An algorithm for solving the longest increasing circular subsequence problem (Q987842)

From MaRDI portal
Revision as of 02:53, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm for solving the longest increasing circular subsequence problem
scientific article

    Statements

    An algorithm for solving the longest increasing circular subsequence problem (English)
    0 references
    16 August 2010
    0 references
    0 references
    algorithms
    0 references
    longest increasing subsequence
    0 references
    longest increasing circular subsequence
    0 references
    string matching
    0 references
    0 references