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

From MaRDI portal
Revision as of 15:51, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    A fast algorithm for the all-pairs suffix-prefix problem (English)
    0 references
    author
    Jihyuk Lim
    0 references
    Kun Soo Park
    0 references
    publication date
    6 November 2017
    0 references
    zbMATH Keywords
    all-pairs suffix-prefix problem
    0 references
    algorithm engineering
    0 references
    DNA sequence assembly
    0 references

    Identifiers

    zbMATH DE Number
    6803095
    0 references
    OpenAlex ID
    W2738126475
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1676303&oldid=36354904"
    Powered by MediaWiki