On the parameterized complexity of the repetition free longest common subsequence problem (Q413298): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92D20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6030966 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithms | |||
Property / zbMATH Keywords: algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial problems | |||
Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
repetition free longest common subsequence | |||
Property / zbMATH Keywords: repetition free longest common subsequence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
longest common subsequence | |||
Property / zbMATH Keywords: longest common subsequence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parameterized complexity | |||
Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank |
Revision as of 20:03, 29 June 2023
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