A linear-time algorithm for finding approximate shortest common superstrings (Q911299): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01840391 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002148379 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 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
