Abstract
Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees T 1,...,T k there exists a larger tree (called a supertree) that contains the topologies of all k input trees. When any such supertree exists we call the instance compatible and otherwise incompatible. It is known that the problem is NP-hard and FPT, although a constructive FPT algorithm is not known. It has been shown that whenever the treewidth of an auxiliary structure known as the display graph is strictly larger than the number of input trees, the instance is incompatible. Here we show that whenever the treewidth of the display graph is at most 2, the instance is compatible. Furthermore, we give a polynomial-time algorithm to construct a supertree in this case. Finally, we demonstrate both compatible and incompatible instances that have display graphs with treewidth 3, highlighting that the treewidth of the display graph is (on its own) not sufficient to determine compatibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A., Sagiv, Y., Szymanski, T., Ullman, J.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing 10(3), 405–421 (1981)
Bininda-Emonds, O.: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Kluwer Academic Publishers (2004)
Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Information and Computation 208(3), 259–275 (2010)
Bryant, D., Lagergren, J.: Compatibility of unrooted phylogenetic trees is FPT. Theoretical Computer Science 351(3), 296–302 (2006)
Courcelle, B.: he monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85(1), 12–75 (1990)
Diestel, R.: Graph Theory. Springer-Verlag Berlin and Heidelberg GmbH & Company KG (2000)
Dress, A., Huber, K.T., Koolen, J.: Basic Phylogenetic Combinatorics. Cambridge University Press (2012)
Ganapathy, G., Warnow, T.J.: Approximating the complement of the maximum compatible subset of leaves of k trees. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 122–134. Springer, Heidelberg (2002)
Grünewald, S., Humphries, P.J., Semple, C.: Quartet compatibility and the quartet graph. Electronic Journal of Combinatorics 15(1) (2008)
Gysel, R., Stevens, K., Gusfield, D.: Reducing problems in unrooted tree compatibility to restricted triangulations of intersection graphs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 93–105. Springer, Heidelberg (2012)
Semple, C., Steel, M.: Phylogenetics. Oxford University Press (2003)
Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification 9(1), 91–116 (1992), doi:10.1007/BF02618470
Vakati, S., Fernández-Baca, D.: Graph triangulations and the compatibility of unrooted phylogenetic trees. Applied Mathematics Letters 24(5), 719–723 (2011)
Vakati, S., Fernández-Baca, D.: Characterizing compatibility and agreement of unrooted trees via cuts in graphs. CoRR abs/1307.7828 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Grigoriev, A., Kelk, S., Lekić, N. (2014). On Low Treewidth Graphs and Supertrees. In: Dediu, AH., MartÃn-Vide, C., Truthe, B. (eds) Algorithms for Computational Biology. AlCoB 2014. Lecture Notes in Computer Science(), vol 8542. Springer, Cham. https://doi.org/10.1007/978-3-319-07953-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-07953-0_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07952-3
Online ISBN: 978-3-319-07953-0
eBook Packages: Computer ScienceComputer Science (R0)