Fast algorithms for computing the tripartition-based distance between phylogenetic networks (Q996826)
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: Fast algorithms for computing the tripartition-based distance between phylogenetic networks |
scientific article; zbMATH DE number 5172681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for computing the tripartition-based distance between phylogenetic networks |
scientific article; zbMATH DE number 5172681 |
Statements
Fast algorithms for computing the tripartition-based distance between phylogenetic networks (English)
0 references
19 July 2007
0 references
Phylogenetic network
0 references
Tripartition-based distance
0 references
Algorithm
0 references
0 references
0.9951221346855164
0 references
0.8780943155288696
0 references
0.8746599555015564
0 references
0.8744019269943237
0 references
0.8732900023460388
0 references
