Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets (Q2784454)
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: Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets |
scientific article; zbMATH DE number 1732344
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets |
scientific article; zbMATH DE number 1732344 |
Statements
23 April 2002
0 references
evolutionary trees
0 references
Jukes-Cantor model of evolution
0 references
Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets (English)
0 references
A greedy learning algorithm is given in this paper for reconstructing an evolutionary tree based on a certain harmonic average on triplets of terminal taxa. The algorithm runs in \(O(n^2)\) time and \(O(n)\) space, which are optimal in the sense that the size of an input distance matrix is \(n^2\) and the size of output tree is \(n\).
0 references
