Approximation algorithms for the shortest common superstring problem (Q1822981)
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: Approximation algorithms for the shortest common superstring problem |
scientific article; zbMATH DE number 4114025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the shortest common superstring problem |
scientific article; zbMATH DE number 4114025 |
Statements
Approximation algorithms for the shortest common superstring problem (English)
0 references
1989
0 references
shortest common superstring problem
0 references
NP-complete
0 references
approximation algorithms
0 references
McCreight's compact suffix tree construction algorithm
0 references
Sleator and Tarjan's lexicographic splay tree data structure
0 references
0.96220493
0 references
0.96210635
0 references
0.95420474
0 references
0.95258605
0 references
0.95173097
0 references
0.9484494
0 references
0.9430032
0 references
0.94185567
0 references
