A greedy approximation algorithm for constructing shortest common superstrings (Q1102756)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4051020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy approximation algorithm for constructing shortest common superstrings |
scientific article; zbMATH DE number 4051020 |
Statements
A greedy approximation algorithm for constructing shortest common superstrings (English)
0 references
1988
0 references
An approximation algorithm for the shortest common superstring problem is developed, based on the Knuth-Pratt string-matching procedure and on the greedy heuristics for finding longest Hamiltonian pathsé-game.
0 references
shortest common superstring
0 references
string-matching
0 references
greedy heuristics
0 references
