Download:
by Sebastian Böcker, Andreas W. M. Dress, Mike A. Steel
Ann. Combin
http://web.math.canterbury.ac.nz/~mathmas/research/patch.pdf
Add To MetaCart
Abstract:
Abstract. A fundamental problem in many areas of classification, and particularly in biology, is the reconstruction of a leaf-labeled tree from just a subset of its induced subtrees. Without loss of generality, we may assume that these induced subtrees all have precisely four leaves. Of particular interest is the question of determining whether a collection of quartet subtrees uniquely defines a parent tree. Here, we solve this question in the case where the collection of quartet trees is of minimal size, by studying encodings of binary trees by such quartet trees. We obtain a characterization of minimal encodings that exploits an underlying “patchwork ” structure. As we will show elsewhere, this allows one to obtain a polynomial time algorithm for certain instances of the problem of reconstructing trees from subtrees.
Citations
|
133
|
The complexity of reconstructing trees from qualitative characters and subtrees
– Steel
- 1992
|
|
128
|
The recovery of trees from measures of dissimilarity
– Buneman
- 1971
|
|
78
|
Reconstructing the shape of a tree from observed dissimilarity data
– Bandelt, Dress
- 1986
|
|
63
|
A few logs suffice to build almost all trees
– Erdős, Steel, et al.
- 1997
|
|
30
|
Haeseler, Quartet Puzzling: a quartet Maximum Likelihood method for reconstructing tree topologies
– Strimmer, von
- 1996
|
|
21
|
Tree structure for proximity data
– Colonius, Schultze
- 1981
|
|
13
|
Simple but fundamental limitations on supertree and consensus tree methods
– Steel, Dress, et al.
- 2000
|
|
13
|
Phylogenetic Inference,” Molecular Systematics
– Swofford, Olsen, et al.
- 1996
|
|
9
|
Algorithmic aspects of tree amalgamation
– Bryant, Böcker, et al.
|
|
8
|
Mathematical approaches to comparative linguistics
– Warnow
- 1997
|
|
7
|
Measuring inconsistency in phylogenetic trees
– Willson
- 1998
|
|
6
|
The disk-covering method for tree reconstruction
– Huson, Nettles, et al.
- 1998
|
|
3
|
parsimonious quartet encodings of binary trees, in preparation
– Bocker, Dress, et al.
|
|
3
|
Obtaining highly accurate topology and evolutionary estimates of evolutionary trees from very short sequences, accepted for RECOMB 99
– Huson, Warnow
- 1998
|
|
2
|
Computer-assisted stemmatic analysis and ‘best-text’ historical editing
– Robinson
- 1996
|
|
1
|
Repräsentation nichtnumerischer Ähnlichkeitsdaten durch
– Colonius, Schulze
- 1979
|
