Greedy algorithms for the shortest common superstring that are asymtotically optimal (Q4595487)
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 asymtotically optimal |
scientific article; zbMATH DE number 6815393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy algorithms for the shortest common superstring that are asymtotically optimal |
scientific article; zbMATH DE number 6815393 |
Statements
Greedy algorithms for the shortest common superstring that are asymtotically optimal (English)
0 references
5 December 2017
0 references
0.99570584
0 references
0.96575165
0 references
0.9495886
0 references
0.9430032
0 references
0.9290289
0 references
0.92872244
0 references
0.9268833
0 references
0.92533875
0 references
