Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient algorithms for the longest common subsequence in \(k\)-length substrings
scientific article

    Statements

    Efficient algorithms for the longest common subsequence in \(k\)-length substrings (English)
    0 references
    0 references
    0 references
    18 July 2014
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references
    \(\mathrm{LCS}k\)
    0 references
    sparse dynamic programming
    0 references

    Identifiers