Published June 2004
| Version Submitted
Journal Article
Open
Reconstructing Trees from Subtree Weights
Abstract
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is an extension of the tree-metric theorem to more general dissimilarity maps. In particular, we show that a tree with n leaves is reconstructible from the weights of the m-leaf subtrees provided that n ≥ 2m - 1.
Additional Information
© 2004 Elsevier. (Received December 2003; accepted January 2004) We thank B. Sturmfels for many comments which improved the manuscript. L. Pachter was partially supported by a Grant from the NIH (R01-HG02362-02).Attached Files
Submitted - 0311156.pdf
Files
0311156.pdf
Additional details
Identifiers
- Eprint ID
- 74827
- Resolver ID
- CaltechAUTHORS:20170307-080948323
Related works
- Describes
- https://arxiv.org/abs/math/0311156 (URL)
Funding
- NIH
- R01-HG02362-02
Dates
- Created
-
2017-03-07Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field