Reconstructing trees from subtree weights
β Scribed by L Pachter; D Speyer
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 482 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
β¦ Synopsis
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 recenstruetible from the weights of the m-leaf subtrees provided that n ~ 2m -i. (~) 2004 Elsevier Ltd. All rights reserved.
π SIMILAR VOLUMES
## Abstract Let π― be the class of unlabeled trees. An unlabeled vertexβdeleted subgraph of a tree __T__ is called a card. A collection of cards is called a deck. We say that the tree __T__ has a deck __D__ if each card in __D__ can be obtained by deleting distinct vertices of __T__. If __T__ is the
In evolutionary biology, a character is a function Ο from a set X of present-day species into a finite set of states. Suppose the species in X have evolved according to a bifurcating tree . Biologists would like to use characters to infer this tree. Assume that Ο is the result of an evolutionary pro
Ring widths of oak trees (Quercus petraea Liebl. and Quercus robur L.) from a network of seven sites in southern Britain and northern France are used to reconstruct riverflow for three river catchments in southern Britain. These dendrohydrological reconstructions, made using a principal components r