Repetition-free longest common subsequence (Q5900087)
From MaRDI portal
scientific article; zbMATH DE number 5285006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Repetition-free longest common subsequence |
scientific article; zbMATH DE number 5285006 |
Statements
Repetition-free longest common subsequence (English)
0 references
5 June 2008
0 references
longest common subsequence
0 references
APX-hard
0 references
approximation algorithms
0 references
