A fast algorithm for the all-pairs suffix-prefix problem (Q1676303)

From MaRDI portal
Revision as of 11:02, 25 July 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
A fast algorithm for the all-pairs suffix-prefix problem
scientific article

    Statements

    A fast algorithm for the all-pairs suffix-prefix problem (English)
    0 references
    0 references
    0 references
    6 November 2017
    0 references
    all-pairs suffix-prefix problem
    0 references
    algorithm engineering
    0 references
    DNA sequence assembly
    0 references

    Identifiers