Why Greed Works for Shortest Common Superstring Problem (Q3506957)

From MaRDI portal
Revision as of 13:16, 11 October 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
Why Greed Works for Shortest Common Superstring Problem
scientific article

    Statements

    title
    Why Greed Works for Shortest Common Superstring Problem (English)
    0 references
    author
    Bin Ma
    0 references
    publication date
    17 June 2008
    0 references

    Identifiers

    zbMATH DE Number
    5289289
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3506957&oldid=7927491"
      Powered by MediaWiki