Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123002641, #quickstatements; #temporary_batch_1708557319324 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:33, 5 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
