Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms for the repetition-bounded longest common subsequence problem |
scientific article |
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
