Faster algorithms for computing longest common increasing subsequences (Q655431)

From MaRDI portal
Revision as of 06:23, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
scientific article
Language Label Description Also known as
English
Faster algorithms for computing longest common increasing subsequences
scientific article

    Statements

    Faster algorithms for computing longest common increasing subsequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2012
    0 references
    common subsequences
    0 references
    increasing subsequences
    0 references
    small alphabets
    0 references
    Van Emde Boas trees
    0 references

    Identifiers