Parameterized complexity and approximability of the longest compatible sequence problem (Q456697)
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: Parameterized complexity and approximability of the longest compatible sequence problem |
scientific article; zbMATH DE number 6094032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity and approximability of the longest compatible sequence problem |
scientific article; zbMATH DE number 6094032 |
Statements
Parameterized complexity and approximability of the longest compatible sequence problem (English)
0 references
16 October 2012
0 references
parameterized complexity
0 references
sequence comparison
0 references
longest common subsequence
0 references
longest compatible sequence
0 references
0 references
0 references
0.91765326
0 references
0.89602304
0 references
0.8931859
0 references
0.8931859
0 references
0.8931233
0 references
0 references
0.88474417
0 references
