Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566)

From MaRDI portal
Revision as of 14:30, 13 November 2023 by Importer (talk | contribs) (‎Created a new 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

    Approximating Shortest Superstring Problem Using de Bruijn Graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2013
    0 references

    Identifiers