BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418)

From MaRDI portal
Revision as of 18:10, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6313575
Language Label Description Also known as
English
BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
scientific article; zbMATH DE number 6313575

    Statements

    title
    BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (English)
    0 references
    author
    Sebastian Deorowicz
    0 references
    Agnieszka Danek
    0 references
    publication date
    4 July 2014
    0 references
    zbMATH DE Number
    6313575
    0 references
    zbMATH Keywords
    sequence comparison
    0 references
    merged longest common subsequence
    0 references
    bit-parallelism
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5168418&oldid=35397798"
    Powered by MediaWiki