Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees (Q5111707)
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: Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees |
scientific article; zbMATH DE number 7204999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees |
scientific article; zbMATH DE number 7204999 |
Statements
27 May 2020
0 references
phylogenetic tree
0 references
tree comparison
0 references
triplet distance
0 references
cache-oblivious algorithm
0 references
0 references
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees (English)
0 references
0.9999999
0 references
0.9234819
0 references
0.89863825
0 references
0.88804126
0 references
0.8762978
0 references
0.8724662
0 references
0.8724662
0 references
