Algorithms for Three Versions of the Shortest Common Superstring Problem (Q3575256)
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: Algorithms for Three Versions of the Shortest Common Superstring Problem |
scientific article; zbMATH DE number 5761610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for Three Versions of the Shortest Common Superstring Problem |
scientific article; zbMATH DE number 5761610 |
Statements
Algorithms for Three Versions of the Shortest Common Superstring Problem (English)
0 references
26 July 2010
0 references
0.96210635
0 references
0.93821245
0 references
0.93505585
0 references
0.9344711
0 references
0.9342896
0 references
0.93137056
0 references
0 references
0.9268833
0 references
