Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547): 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.tcs.2020.07.042 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3047376977 / rank | |||
Normal rank | |||
Revision as of 01:07, 20 March 2024
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
