A linear-time algorithm for finding approximate shortest common superstrings (Q911299): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:35, 5 March 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