On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706)
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 2092872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems |
scientific article; zbMATH DE number 2092872 |
Statements
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (English)
0 references
19 August 2004
0 references
Parameterized complexity
0 references
Longest common subsequence
0 references
Shortest common supersequence
0 references
Multiple sequence alignment
0 references
0 references
0.8862074613571167
0 references
0.8361213207244873
0 references
0.8361213207244873
0 references
0.8240854740142822
0 references
0.8237622380256653
0 references
