A linear-time algorithm for finding approximate shortest common superstrings (Q911299): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:58, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for finding approximate shortest common superstrings |
scientific article |
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
