Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458)

From MaRDI portal
Revision as of 04:09, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Greedy algorithms for the shortest common superstring that are asymptotically optimal
scientific article

    Statements

    Greedy algorithms for the shortest common superstring that are asymptotically optimal (English)
    0 references
    0 references
    0 references
    24 May 1998
    0 references
    0 references
    shortest common superstring
    0 references
    0 references
    0 references
    0 references