Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566)

From MaRDI portal
Revision as of 13:40, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6176329
Language Label Description Also known as
English
Approximating Shortest Superstring Problem Using de Bruijn Graphs
scientific article; zbMATH DE number 6176329

    Statements

    title
    Approximating Shortest Superstring Problem Using de Bruijn Graphs (English)
    0 references
    author
    Alexander Golovnev
    0 references
    Ivan Mihajlin
    0 references
    Alexander S. Kulikov
    0 references
    publication date
    14 June 2013
    0 references
    zbMATH DE Number
    6176329
    0 references
    OpenAlex ID
    W194848955
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4928566&oldid=35337153"
    Powered by MediaWiki