An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (Q290256)
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: An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree |
scientific article; zbMATH DE number 6588312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree |
scientific article; zbMATH DE number 6588312 |
Statements
An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (English)
0 references
1 June 2016
0 references
evolutionary tree
0 references
computational biology
0 references
algorithms
0 references
0.8774622
0 references
0.86359954
0 references
0.8593451
0 references
0.8586026
0 references
0.85416543
0 references
0.8527431
0 references
0.8516451
0 references
