Repetition-free longest common subsequence (Q5901069): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q987678 |
||
| Property / author | |||
| Property / author: Fábio Viduani Martinez / rank | |||
Revision as of 23:57, 21 February 2024
scientific article; zbMATH DE number 5770506
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Repetition-free longest common subsequence |
scientific article; zbMATH DE number 5770506 |
Statements
Repetition-free longest common subsequence (English)
0 references
13 August 2010
0 references
longest common subsequence
0 references
APX-hardness
0 references
approximation algorithms
0 references
