A combinatorial description of the closest tree algorithm for finding evolutionary trees (Q1182982)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combinatorial description of the closest tree algorithm for finding evolutionary trees |
scientific article; zbMATH DE number 32567
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial description of the closest tree algorithm for finding evolutionary trees |
scientific article; zbMATH DE number 32567 |
Statements
A combinatorial description of the closest tree algorithm for finding evolutionary trees (English)
0 references
28 June 1992
0 references
Consider the closest tree algorithm for estimating the evolutionary history of \(n\) species. The previous branch and bound approach requires \(O(n^ n 2^ n)\) steps. The more efficient algorithm described in this paper requires \(O(n2^ n)\) steps for some classes of sequences.
0 references
evolutionary trees
0 references
maximum parsimony
0 references
phylogenetic tree reconstruction
0 references
0.9003217
0 references
0 references
0.8815397
0 references
0.88129646
0 references
0.88081086
0 references
0 references
