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

From MaRDI portal
Revision as of 22:34, 10 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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
    24 May 1998
    0 references
    shortest common superstring
    0 references
    0 references
    0 references

    Identifiers