A learning algorithm for the longest common subsequence problem (Q5463438)

From MaRDI portal
Revision as of 19:03, 27 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2192067
Language Label Description Also known as
English
A learning algorithm for the longest common subsequence problem
scientific article; zbMATH DE number 2192067

    Statements

    A learning algorithm for the longest common subsequence problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2005
    0 references
    0 references
    learning algorithm
    0 references
    longest common subsequence
    0 references