Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6546417)
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: Polynomial-time equivalences and refined algorithms for longest common subsequence variants |
scientific article; zbMATH DE number 7855811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time equivalences and refined algorithms for longest common subsequence variants |
scientific article; zbMATH DE number 7855811 |
Statements
Polynomial-time equivalences and refined algorithms for longest common subsequence variants (English)
0 references
29 May 2024
0 references
longest common subsequence
0 references
repetition-bounded
0 references
multiset-restricted
0 references
one-side-filled
0 references
two-side-filled
0 references
dynamic programming
0 references
exact algorithm
0 references
approximation algorithm
0 references
0 references
