On the parameterized complexity of the repetition free longest common subsequence problem (Q413298)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the parameterized complexity of the repetition free longest common subsequence problem |
scientific article; zbMATH DE number 6030966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of the repetition free longest common subsequence problem |
scientific article; zbMATH DE number 6030966 |
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
0.9425051
0 references
0.9425051
0 references
0.9369234
0 references
0.9310169
0 references
0.92655635
0 references
0.92087746
0 references
0.92038536
0 references
0.9187136
0 references
