Repetition-free longest common subsequence (Q5900087)
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: Repetition-free longest common subsequence |
scientific article; zbMATH DE number 5285006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9592042
0 references
0 references
0.9122206
0 references
0.91199005
0 references
0.91011584
0 references
0 references
0.90947145
0 references
