Abstract
Compatibility of phylogenetic trees is the most important concept underlying widely-used methods for assessing the agreement of different phylogenetic trees with overlapping taxa and combining them into common supertrees to reveal the tree of life. The notion of ancestral compatibility of phylogenetic trees with nested taxa was recently introduced. In this paper we analyze in detail the meaning of this compatibility from the points of view of the local structure of the trees, of the existence of embeddings into a common supertree, and of the joint properties of their cluster representations. Our analysis leads to a very simple polynomial-time algorithm for testing this compatibility, which we have implemented and is freely available for download from the BioPerl collection of Perl modules for computational biology.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baum B.R. (1992) Combining trees as a way of combining datasets for phylogenetic inference, and the desirability of combining gene trees. Taxon 41(1): 3–10
Bininda-Emonds O.R.P. (ed) (2004) Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, Computational Biology, vol 4. Kluwer, Dordrecht
Daniel P., Semple C. (2004) Supertree algorithms for nested taxa. In: Bininda-Emonds O.R.P. (ed) Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Computational Biology, vol 4, chap 7. Kluwer, Dordrecht, pp. 151–171
Morell, V.: TreeBASE: The roots of phylogeny. Science 273(5275), 569–570 (1996). http://www.treebase.org
Page R.D.M. Modified mincut supertrees. In: Proceedings of the 2nd International Workshop Algorithms in Bioinformatics. Lecture Notes in Computer Science, vol. 2452, pp. 537–552. Springer, Berlin Heidelberg New York (2002)
Page R.D.M. (2004) Taxonomy, supertrees, and the tree of life. In: Bininda-Emonds O.R.P. (ed) Phylogenetic Supertrees: Combining information to reveal the tree of life Computational Biology, vol. 4. Springer, Berlin Heidelberg New York, pp. 247–265
Ragan M.A. (1992) Phylogenetic inference based on matrix representation of trees. Mol. Phylogenet. Evol. 1(1): 53–58
Rosselló, F., Valiente, G.: An algebraic view of the relation between largest common subtrees and smallest common supertrees. Tech. rep., Technical University of Catalonia (2004)
Semple C., Daniel P., Hordijk W., Page R.D.M., Steel M. (2004) Supertree algorithms for ancestral divergence dates and nested taxa. Bioinformatics 20(15): 2355–2360
Semple C., Steel M. (2003) Phylogenetics. Oxford University Press, Oxford
Semple C., Steel M.A. (2000) A supertree method for rooted trees. Discrete Appl. Math. 105(1–3): 147–158
Stajich J.E., Block D., Boulez K., Brenner S.E., Chervitz S.A., Dagdigian C., Fuellen G., GilbertJ.G., Korf, I., Lapp, H., Lehvaslaiho, H., Matsalla, C., Mungall, C.J., Osborne, B.I., Pocock, M.R., Schattner, P., Senger, M., Stein, L.D., Stupka, E., Wilkinson, M.D., Birney, E.: The BioPerl toolkit: Perl modules for the life sciences. Genome Res. 12(10), 1611–1618 (2002). http://www.bioperl.org
Steel M.A., Warnow T. (1993) Kaikoura tree theorems: Computing the maximum agreement subtree. Inf. Process. Lett. 48(2): 77–82
Warnow T. (1994) Tree compatibility and inferring evolutionary history. J. Algorithms 16(3): 388–407
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Llabrés, M., Rocha, J., Rosselló, F. et al. On the Ancestral Compatibility of Two Phylogenetic Trees with Nested Taxa. J. Math. Biol. 53, 340–364 (2006). https://doi.org/10.1007/s00285-006-0011-4
Received:
Revised:
Published:
Issue date:
DOI: https://doi.org/10.1007/s00285-006-0011-4
