On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The parameterized complexity of sequence alignment and consensus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4393480 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The shortest common supersequence problem over binary alphabet is NP- complete / rank | |||
Normal rank | |||
Latest revision as of 19:09, 6 June 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
0 references
