A linear-time algorithm for finding approximate shortest common superstrings (Q911299)
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: A linear-time algorithm for finding approximate shortest common superstrings |
scientific article; zbMATH DE number 4141516
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for finding approximate shortest common superstrings |
scientific article; zbMATH DE number 4141516 |
Statements
A linear-time algorithm for finding approximate shortest common superstrings (English)
0 references
1990
0 references
linear-time algorithm
0 references
shortest common superstring
0 references
approximation algorithm
0 references
greedy heuristics
0 references
Hamiltonian path
0 references
