Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811)
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: Computing phylogenetic roots with bounded degrees and errors is NP-complete |
scientific article; zbMATH DE number 5083477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing phylogenetic roots with bounded degrees and errors is NP-complete |
scientific article; zbMATH DE number 5083477 |
Statements
Computing phylogenetic roots with bounded degrees and errors is NP-complete (English)
0 references
9 January 2007
0 references
phylogeny
0 references
phylogenetic root
0 references
computational biology
0 references
NP-hardness
0 references
0.9185982942581176
0 references
0.8450857400894165
0 references
0.8435825705528259
0 references
