On the parameterized complexity of the repetition free longest common subsequence problem (Q413298): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:41, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of the repetition free longest common subsequence problem |
scientific article |
Statements
On the parameterized complexity of the repetition free longest common subsequence problem (English)
0 references
4 May 2012
0 references
algorithms
0 references
combinatorial problems
0 references
repetition free longest common subsequence
0 references
longest common subsequence
0 references
parameterized complexity
0 references
