Abstract
A classical result, fundamental to evolutionary biology, states that an edge-weighted tree T with leaf set X, positive edge weights, and no vertices of degree 2 can be uniquely reconstructed from the leaf-to-leaf distances between any two elements of X. In biology, X corresponds to a set of taxa (e.g. extant species), the tree T describes their phylogenetic relationships, the edges correspond to earlier species evolving for a time until splitting in two or more species by some speciation/bifurcation event, and their length corresponds to the genetic change accumulating over that time in such a species. In this paper, we investigate which subsets of \({\binom{X}{2}}\) suffice to determine (‘lasso’) the tree T from the leaf-to-leaf distances induced by that tree. The question is particularly topical since reliable estimates of genetic distance—even (if not in particular) by modern mass-sequencing methods—are, in general, available only for certain combinations of taxa.
Similar content being viewed by others
References
Atteson K (1999) The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25: 251–278
Barthélemy JP, Guéoche A (1991) Trees and proximity representations. Wiley, New York
Böcker S, Dress AWM, Steel M (1999) Patching up X-trees. Ann Combin 3: 1–12
Chaiken S, Dewdney AK, Slater PJ (1983) An optimal diagonal tree code. SIAM J Alg Disc Math 4(1): 42–49
Colonius H, Schulze HH (1981) Tree structures for proximity data. Br J Math Stat Psychol 34: 167–180
Dress A, Erdös PL (2003) X-trees and weighted quartet systems. Ann Combin 7: 155–169
Dress A, Steel M (2009) A Hall-type theorem for triplet set systems based on medians in trees. Appl Math Lett 22: 1789–1792
Dress A, Huber KT, Steel M (2011a) Lassoing a phylogenetic tree (II). In preparation
Dress A, Huber KT, Koolen J, Moulton V, Spillner A (2011b) Basic phylogenetic combinatorics. Cambridge University Press (in press)
Farach M, Kannan S, Warnow T (1995) A robust model for finding optimal evolutionary trees. Algorithmica 13: 155–179
Felsenstein J (2004) Inferring phylogenies. Sinauer Associates, Sunderland
Guénoche A, Leclerc B (2001) The triangles method to build X-trees from incomplete distance matrices. ROADEF’99 (Autrans) RAIRO Oper Res 35(2): 283–300
Guénoche A, Leclerc B, Markarenkov V (2004) On the extension a partial metric to a tree metric. Discr Appl Math 276: 229–248
Grünewald S, Huber KT, Moulton V, Semple C (2008) Encoding phylogenetic trees in terms of weighted quartets. J Math Biol 56: 465–477
Philippe H, Snell E, Bapteste E, Lopez P, Holland P, Casane D (2004) Phylogenomics of eukaryotes: impact of missing data on large alignments. Mol Biol Evol 21: 1740–1752
Semple C, Steel M (2003) Phylogenetics. Oxford University Press, Oxford
Steel MA (1992) The complexity of reconstructing trees from qualitative characters and subtrees. J Classif 9: 91–116
Willson SJ (2004) Computing rooted supertrees using distances. Bull Math Biol 66(6): 1755–1783
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dress, A.W.M., Huber, K.T. & Steel, M. ‘Lassoing’ a phylogenetic tree I: basic properties, shellings, and covers. J. Math. Biol. 65, 77–105 (2012). https://doi.org/10.1007/s00285-011-0450-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00285-011-0450-4