Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938)
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: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks |
scientific article |
Statements
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (English)
0 references
26 February 2010
0 references
triplet
0 references
phylogenetic network
0 references
level-\(k\) network
0 references
0 references
0 references
0.88829184
0 references
0.8850822
0 references
0.8850822
0 references
0.88252234
0 references
0.88158286
0 references
0.88158286
0 references
0 references
0.8801986
0 references
0.8793191
0 references
