A greedy approximation algorithm for constructing shortest common superstrings (Q1102756): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:42, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy approximation algorithm for constructing shortest common superstrings |
scientific article |
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
