Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time (Q3637119)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time |
scientific article |
Statements
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time (English)
0 references
7 July 2009
0 references
0 references
0 references
0 references
