Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Greedy algorithms for the shortest common superstring that are asymptotically optimal |
scientific article; zbMATH DE number 1154608
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithms for the shortest common superstring that are asymptotically optimal |
scientific article; zbMATH DE number 1154608 |
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
