Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree (Q5741840)
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 7055365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree |
scientific article; zbMATH DE number 7055365 |
Statements
Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree (English)
0 references
15 May 2019
0 references
0.9180659651756288
0 references
0.911100447177887
0 references
0.8661184310913086
0 references
0.8646491765975952
0 references
0.8611540794372559
0 references
