Label-increasing trees are fully labeled rooted trees with the restriction that the labels are in increasing order on every path from the root; the best known example is the binary case-no tree with more than two branches at the root, or internal vertices of degree greater than threeextensively exam
Phylogenetic trees and evolutionary forests
β Scribed by Jonathan Marks
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 100 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1060-1538
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Uniform and minimal random spanning trees for finite graphs are well-known objects. Analogues of these for the nearest-neighbor graph on Z d have been studied by Pemantle and Alexander. Here we propose analogous definitions of uniform resp. minimal essential spanning forests for an infinite tree β«,
In this paper we study the algorithmic problem of constructing rooted evolutionary trees in the so-called experiment model. This model was first presented by Ε½ Ε½ . .
## Abstract We suggest a novel distanceβbased method for the determination of phylogenetic trees. It is based on multidimensional scaling and Euclidean Steiner trees in highβdimensional spaces. Preliminary computational experience shows that the use of Euclidean Steiner trees for finding phylogenet