Name
Abstract | ||
|---|---|---|
A fundamental problem in biological classification is the reconstruction of phylogenetic trees for a set X of species from a collection of either subtrees or qualitative characters. This task is equivalent to tree reconstruction from a set of partial X-splits (bipartitions of subsets of X). In this paper, we define and analyse a "closure" operation for partial X-splits that was informally proposed by Meacham [5]. In particular, we establish a sufficient condition for such an operation to reconstruct a tree when there is essentially only one tree that displays the partial X-splits. This result exploits a recent combinatorial result from [2]. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-45727-5_11 | JOBIM |
Keywords | Field | DocType |
sufficient condition,tree reconstruction,partial splits,set x,partial x-splits,closure operation,qualitative character,fundamental problem,biological classification,recent combinatorial result,phylogenetic tree,supertree,closure operator,compatibility | Biological classification,Combinatorics,Phylogenetic tree,Supertree,Tree structure,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-42242-0 | 5 | 1.00 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Charles Semple | 1 | 43 | 4.38 |
| Mike Steel | 2 | 270 | 41.87 |