The parameterized complexity of sequence alignment and consensus (Q1367540)
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 parameterized complexity of sequence alignment and consensus |
scientific article; zbMATH DE number 1065141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterized complexity of sequence alignment and consensus |
scientific article; zbMATH DE number 1065141 |
Statements
The parameterized complexity of sequence alignment and consensus (English)
0 references
29 September 1997
0 references
longest common subsequence problem
0 references
parameterized computational complexity
0 references
0 references
0.8862074613571167
0 references
0.8562034368515015
0 references
0.8304805755615234
0 references
0.8275771737098694
0 references
