Why Greed Works for Shortest Common Superstring Problem (Q3506957)

From MaRDI portal
Revision as of 22:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    OpenAlex ID
    W2129525792
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3506957&oldid=32274512"
    Powered by MediaWiki