Abstract
One of the main problems in phylogenetics is to develop systematic methods for constructing evolutionary or phylogenetic trees. For a set of species X, an edge-weighted phylogenetic X-tree or phylogenetic tree is a (graph theoretical) tree with leaf set X and no degree 2 vertices, together with a map assigning a non-negative length to each edge of the tree. Within phylogenetics, several methods have been proposed for constructing such trees that work by trying to piece together quartet trees on X, i.e. phylogenetic trees each having four leaves in X. Hence, it is of interest to characterise when a collection of quartet trees corresponds to a (unique) phylogenetic tree. Recently, Dress and Erdös provided such a characterisation for binary phylogenetic trees, that is, phylogenetic trees all of whose internal vertices have degree 3. Here we provide a new characterisation for arbitrary phylogenetic trees.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bandelt H.-J. and Dress A. (1986). Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7: 309–343
Ben-Dor A., Chor B., Graur D., Ophir R. and Pelleg D. (1998). Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships. J. Comp. Biol. 5: 377–390
Berry V. and Gascuel O. (2000). Inferring evolutionary trees with strong combinatorial evidence. Theor. Comput. Sci. 240: 271–298
Berry, V., Jiang, T., Kearney, P., Li, M., Wareham, T.: Quartet cleaning: improved algorithms and simulations. In: Proceedings of the 7th European symposium on algorithm (ESA99), pp. 313–324 (1999)
Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life; Computational Biology 4. Kluwer, Dordrecht (2004)
Buneman P. (1971). The recovery of trees from measures of dissimilarity. In: Hodson, F.R., Kendall, D.G. and Tautu, P. (eds) Mathematics in the Archaeological and Historical Sciences, pp 387–395. Edinburgh University Press, Edinburgh
Colonius, H., Schultze, H.H.: Trees constructed from empirical relations, Braunschweiger Berichte aus dem Institut fuer Psychologie, 1 (1977)
Colonius H. and Schultze H.H. (1981). Tree structure from proximity data. Br. J. Math. Stat. Psych. 34: 167–180
Dress A. and Erdös P. (2003). X-trees and weighted quartet systems. Ann. Comb. 7: 155–169
Felsenstein J. (2004). Inferring Phylogenies. Sinauer Associates, Sunderland
Salemi, M., Vandamme, A.-M. (eds.): The Phylogenetic Handbook. Cambridge University Press, London (2003)
Semple C. and Steel M. (2003). Phylogenetics. Oxford University Press, Oxford
Strimmer K. and von Haeseler A. (1996). Quartet puzzling: A quartet maximum likelihood method for reconstructing tree topologies. Mol. Biol. Evol. 13: 964–969
Sugden A.M., Jasny B.R., Culotta E. and Pennisi E. (2003). Charting the evolutionary history of life. Science 300(5626): 1691
Weyer-Menkhoff J., Devauchelle C., Grossmann A. and Grünewald S. (2005). Integer linear programming as a tool for constructing trees from quartet data. Comput. Biol. Chem. 29: 196–203
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grünewald, S., Huber, K.T., Moulton, V. et al. Encoding phylogenetic trees in terms of weighted quartets. J. Math. Biol. 56, 465–477 (2008). https://doi.org/10.1007/s00285-007-0125-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00285-007-0125-3