Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7242339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the repetition-bounded longest common subsequence problem |
scientific article; zbMATH DE number 7242339 |
Statements
Exact algorithms for the repetition-bounded longest common subsequence problem (English)
0 references
1 September 2020
0 references
repetition-bounded longest common subsequence problem
0 references
repetition-freeness
0 references
exponential-time exact algorithms
0 references
dynamic programming
0 references
NP-hardness
0 references
APX-hardness
0 references
0 references
0.9301264882087708
0 references
0.8341554999351501
0 references
0.8329632878303528
0 references
0.8235609531402588
0 references
0.8159346580505371
0 references
