On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems |
scientific article |
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
