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 the normal view instead:
scientific article; zbMATH DE number 1154608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9966475963592528
0 references
0.89113849401474
0 references
0.8906996250152588
0 references
0.8827067017555237
0 references
