1 research outputs found
Efficient algorithms for the longest common subsequence in -length substrings
Finding the longest common subsequence in -length substrings (LCS) is a
recently proposed problem motivated by computational biology. This is a
generalization of the well-known LCS problem in which matching symbols from two
sequences and are replaced with matching non-overlapping substrings of
length from and . We propose several algorithms for LCS, being
non-trivial incarnations of the major concepts known from LCS research (dynamic
programming, sparse dynamic programming, tabulation). Our algorithms make use
of a linear-time and linear-space preprocessing finding the occurrences of all
the substrings of length from one sequence in the other sequence.Comment: Submitted to a journa