On the hardness of the consensus string problem (Q396596)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6329873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of the consensus string problem |
scientific article; zbMATH DE number 6329873 |
Statements
On the hardness of the consensus string problem (English)
0 references
13 August 2014
0 references
combinatorial problems
0 references
computational complexity
0 references
consensus
0 references
Hamming distance
0 references
swap
0 references
reversal
0 references
0 references
0 references
0.8781824707984924
0 references
0.8275544047355652
0 references
0.7976257801055908
0 references
0.7975571155548096
0 references
0.7887589335441589
0 references
