On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 05:01, 5 March 2024
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
