Efficient algorithms for the longest common subsequence in $k$-length substrings

Sebastian Deorowicz, Szymon Grabowski

Finding the longest common subsequence in $k$-length substrings (LCS$k$) is a recently proposed problem motivated by computational biology. This is a generalization of the well-kno…