Efficient algorithms for the longest common subsequence problem with sequential substring constraints

In this paper, we generalize the inclusion constrained longest common subsequence (CLCS) problem to the hybrid CLCS problem which is the combination of the sequence inclusion CLCS and the string inclusion CLCS, called the sequential substring constrained longest common subsequence (SSCLCS) problem. In the SSCLCS problem, we are given two strings A and B of lengths m and n, respectively, formed by alphabet Σ and a constraint sequence C formed by ordered strings (C1,C2,C3,…,Cl) with total length r. The problem is that of finding the longest common subsequence D of A and B containing C1,C2,C3,…,Cl as substrings and with the order of the C's retained. This problem has two variants, depending on whether the strings in C cannot overlap or may overlap. We propose algorithms with O(mnl+(m+n)(|Σ|+r)) and O(mnr+(m+n)|Σ|) time for the two variants. For the special case with one or two constraints, our algorithm runs in O(mn+(m+n)(|Σ|+r)) or O(mnr+(m+n)|Σ|) time, respectively-an order faster than the algorithm proposed by Chen and Chao.