Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2004 | 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
Files (139.9 kB)
Name Size Download all
md5:75601d5aef1176c8c0d02f2900415cd2
139.9 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 24, 2023