Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2017.04.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2017.04.017 / rank | |||
Normal rank | |||
Latest revision as of 08:17, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relationship between superstring and compression measures: new insights on the greedy conjecture |
scientific article |
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
