Abstract
In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species X; these relationships are often depicted via a phylogenetic tree – a tree having its leaves univocally labeled by elements of X and without degree-2 nodes – called the “species tree”. One common approach for reconstructing a species tree consists in first constructing several phylogenetic trees from primary data (e.g. DNA sequences originating from some species in X), and then constructing a single phylogenetic tree maximizing the “concordance” with the input trees. The so-obtained tree is our estimation of the species tree and, when the input trees are defined on overlapping – but not identical – sets of labels, is called “supertree”. In this paper, we focus on two problems that are central when combining phylogenetic trees into a supertree: the compatibility and the strict compatibility problems for unrooted phylogenetic trees. These problems are strongly related, respectively, to the notions of “containing as a minor” and “containing as a topological minor” in the graph community. Both problems are known to be fixed-parameter tractable in the number of input trees k, by using their expressibility in Monadic Second Order Logic and a reduction to graphs of bounded treewidth. Motivated by the fact that the dependency on k of these algorithms is prohibitively large, we give the first explicit dynamic programming algorithms for solving these problems, both running in time \(2^{O(k^2)}\,\cdot n\), where n is the total size of the input.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10(3), 405–421 (1981)
Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Computational Biology, vol. 4. Springer, Netherlands (2004)
Bininda-Emonds, O.R., Gittleman, J.L., Steel, M.A.: The (super) tree of life: procedures, problems, and prospects. Ann. Rev. Ecol. Syst. 33, 265–289 (2002)
Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: An \(O(c^k n)\) 5-approximation algorithm for treewidth. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 499–508 (2013)
Bryant, D., Lagergren, J.: Compatibility of unrooted phylogenetic trees is FPT. Theor. Comput. Sci. 351(3), 296–302 (2006)
Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 150–159 (2011)
Delsuc, F., Brinkmann, H., Philippe, H.: Phylogenomics and the reconstruction of the tree of life. Nat. Rev. Genet. 6(5), 361–375 (2005)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)
Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Incorporated, Sunderland (2004)
Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130(1–3), 3–31 (2004)
Gordon, A.D.: Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labeled leaves. J. Classif. 3(2), 335–348 (1986)
Kloks, T.: Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)
Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41–72 (2011)
Maddison, W.: Reconstructing character evolution on polytomous cladograms. Cladistics 5(4), 365–377 (1989)
Ng, M., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69(1–2), 19–31 (1996)
Scornavacca, C.: Supertree methods for phylogenomics. Ph.D. thesis, Université Montpellier II-Sciences et Techniques du Languedoc (2009)
Scornavacca, C., van Iersel, L., Kelk, S., Bryant, D.: The agreement problem for unrooted phylogenetic trees is FPT. J. Graph Algorithms Appl. 18(3), 385–392 (2014)
Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. J. Classif. 9, 91–116 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Baste, J., Paul, C., Sau, I., Scornavacca, C. (2016). Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. In: Dondi, R., Fertin, G., Mauri, G. (eds) Algorithmic Aspects in Information and Management. AAIM 2016. Lecture Notes in Computer Science(), vol 9778. Springer, Cham. https://doi.org/10.1007/978-3-319-41168-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-41168-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41167-5
Online ISBN: 978-3-319-41168-2
eBook Packages: Computer ScienceComputer Science (R0)