A longest common subsequence algorithm suitable for similar text strings (Q1168731)

From MaRDI portal
Revision as of 05:00, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A longest common subsequence algorithm suitable for similar text strings
scientific article

    Statements

    title
    A longest common subsequence algorithm suitable for similar text strings (English)
    0 references
    author
    Narao Nakatsu
    0 references
    Yahiko Kambayashi
    0 references
    Shuzo Yajima
    0 references
    publication date
    1982
    0 references

    Identifiers

    DOI
    10.1007/BF00264437
    0 references
    zbMATH DE Number
    3776858
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1168731&oldid=13236600"
    Powered by MediaWiki