Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842)

From MaRDI portal
Revision as of 09:59, 5 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
Fast algorithms for computing the constrained LCS of run-length encoded strings
scientific article

    Statements

    Fast algorithms for computing the constrained LCS of run-length encoded strings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2012
    0 references
    design of algorithms
    0 references
    longest common subsequence
    0 references
    run-length encoding
    0 references
    constrained LCS
    0 references
    0 references

    Identifiers