Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6496843)
From MaRDI portal
scientific article; zbMATH DE number 7842476
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time equivalences and refined algorithms for longest common subsequence variants |
scientific article; zbMATH DE number 7842476 |
Statements
Polynomial-time equivalences and refined algorithms for longest common subsequence variants (English)
0 references
6 May 2024
0 references
repetition-bounded longest common subsequence problem
0 references
multiset restricted longest common subsequence problem
0 references
one-side-filled longest common subsequence problem
0 references
two-side-filled longest common subsequence problem
0 references
exact algorithms
0 references
approximation algorithms
0 references
