Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482)

From MaRDI portal
Revision as of 20:04, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers