Computing a longest common subsequence for a set of strings (Q786541)

From MaRDI portal
Revision as of 08:49, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing a longest common subsequence for a set of strings
scientific article

    Statements

    title
    Computing a longest common subsequence for a set of strings (English)
    0 references
    author
    W. J. Hsu
    0 references
    M. W. Du
    0 references
    published in
    BIT
    0 references
    publication date
    1984
    0 references
    zbMATH Keywords
    24, 45-59 (1984)
    0 references
    longest common subsequence
    0 references
    analysis of algorithms
    0 references
    string merging
    0 references

    Identifiers

    DOI
    10.1007/BF01934514
    0 references
    zbMATH DE Number
    3839338
    0 references
    OpenAlex ID
    W2003021193
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q786541&oldid=36952636"
    Powered by MediaWiki