Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458): 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:57, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithms for the shortest common superstring that are asymptotically optimal |
scientific article |
Statements
Greedy algorithms for the shortest common superstring that are asymptotically optimal (English)
0 references
24 May 1998
0 references
shortest common superstring
0 references
