The consensus string problem for a metric is NP-complete (Q876700)
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: The consensus string problem for a metric is NP-complete |
scientific article; zbMATH DE number 5147084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The consensus string problem for a metric is NP-complete |
scientific article; zbMATH DE number 5147084 |
Statements
The consensus string problem for a metric is NP-complete (English)
0 references
26 April 2007
0 references
consensus string
0 references
multiple sequence alignment
0 references
NP-complete
0 references
0.8781824707984924
0 references
0.818442165851593
0 references
0.8075146079063416
0 references
0.7987183332443237
0 references
0.7851060032844543
0 references
