Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.04.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2615811680 / rank | |||
Normal rank | |||
Revision as of 22:04, 19 March 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
