On the parameterized complexity of the repetition free longest common subsequence problem (Q413298): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.12.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2055835487 / rank | |||
Normal rank |
Revision as of 20:00, 19 March 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