An \(O(n \log n)\) time algorithm for computing the path-length distance between trees (Q2319639)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7096143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n \log n)\) time algorithm for computing the path-length distance between trees |
scientific article; zbMATH DE number 7096143 |
Statements
An \(O(n \log n)\) time algorithm for computing the path-length distance between trees (English)
0 references
20 August 2019
0 references
phylogeny
0 references
tree comparison metrics
0 references
path-length metric
0 references
tree decomposition
0 references
0.9020441
0 references
0.88174945
0 references
0.87994325
0 references
0 references
0.8702681
0 references
0.86991537
0 references
0 references
