Reconstructing Trees from Subtree Weights

Simple item page
dc.creatorPachter, Lior
dc.creatorSpeyer, David E
dc.date2003-11-11
dc.date.accessioned2026-07-07T05:02:47Z
dc.date.available2026-07-07T05:02:47Z
dc.descriptionThe 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 \geq 2m-1.
dc.identifierhttps://arxiv.org/abs/math/0311156
dc.identifierhttp://arxiv.org/abs/math/0311156
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69143
dc.subjectCombinatorics
dc.subjectPopulations and Evolution
dc.titleReconstructing Trees from Subtree Weights
dc.typetext

Files

Collections

arXiv