1 paper
Yohei Ueki, Diptarama, Masatoshi Kurihara +6
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least k length substrings. First, we show a…