Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy [article]

Janosch Otto Döcker, Universitaet Tuebingen, Dorn, Britta (Apl. Prof. Dr.)
<span title="2021-09-09">2021</span>
In this thesis, we consider the complexity of decision problems from two different areas of research and place them in the polynomial hierarchy: phylogenetics and (quantified) propositional logic. In phylogenetics, researchers study the evolutionary relationships between species. The evolution of a particular gene can often be represented by a single phylogenetic tree. However, in order to model non-tree-like events on a species level such as hybridization and lateral gene transfer,
more &raquo; ... networks are used. They can be considered as a structure that embeds a whole set of phylogenetic trees which is called the display set of the network. There are many interesting questions revolving around display sets and one is often interested in the computational complexity of the considered problems for particular classes of networks. In this thesis, we present our results for different questions related to the display sets of two networks and place the corresponding decision problems in the polynomial hierarchy. Another interesting question concerns the reconstruction of networks: given a set T of phylogenetic trees, can we construct a phylogenetic network with certain properties that embeds all trees in T? For a class of networks that satisfies certain temporal properties, Humphries et al. (2013) established a characterization for when this is possible based on the existence of a particular structure for T, a so-called cherry-picking sequence. We obtain several complexity results for the existence of such a sequence: Deciding the existence of a cherry-picking sequence turns out to be NP-complete for each non-trivial number (i.e., at least two) of given trees. Thereby, we settle the open question stated by Humphries et al. (2013) on the complexity for the case |T| = 2. On the positive side, we identify a special case that we place in the complexity class P by exploring connections to automata theory. Regarding propositional logic, we present our complexity results for the classical satisfiability problem (and variant [...]
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.15496/publikation-60076</a> <a target="_blank" rel="external noopener" href="">fatcat:odzek7qjy5cdxn4zop3ffn54cy</a> </span>
<a target="_blank" rel="noopener" href=";jsessionid=6750523913F99CE58C7A3EAEE490D7CA?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / </button> </a>