Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482)
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 6872409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relationship between superstring and compression measures: new insights on the greedy conjecture |
scientific article; zbMATH DE number 6872409 |
Statements
Relationship between superstring and compression measures: new insights on the greedy conjecture (English)
0 references
24 May 2018
0 references
approximation algorithm
0 references
shortest common superstring problem
0 references
stringology
0 references
data compression
0 references
assembly
0 references
greedy conjecture
0 references
0 references
0 references
0.8467247486114502
0 references
0.8442590832710266
0 references
0.8424978256225586
0 references
0.8339822888374329
0 references
0.8335986733436584
0 references
