A greedy approximation algorithm for constructing shortest common superstrings (Q1102756): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90167-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090223576 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The greedy travelling salesman's problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Storing a sparse table / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:16, 18 June 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
