A fast algorithm for computing longest common subsequences (Q4125781)

From MaRDI portal
Revision as of 08:39, 6 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 3551905
Language Label Description Also known as
English
A fast algorithm for computing longest common subsequences
scientific article; zbMATH DE number 3551905

    Statements

    title
    A fast algorithm for computing longest common subsequences (English)
    0 references
    author
    James W. Hunt
    0 references
    Thomas G. Szymanski
    0 references
    publication date
    1977
    0 references

    Identifiers

    DOI
    10.1145/359581.359603
    0 references
    zbMATH DE Number
    3551905
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4125781&oldid=17911489"
    Powered by MediaWiki