\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853)

From MaRDI portal
Revision as of 19:35, 13 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1417074
Language Label Description Also known as
English
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
scientific article; zbMATH DE number 1417074

    Statements

    \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (English)
    0 references
    0 references
    19 March 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    shortest superstring
    0 references
    shotgun sequencing
    0 references
    data compression
    0 references