%0 Journal Article
%T A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint
%A Daxin Zhu
%A Xiaodong Wang
%J Algorithms
%D 2013
%I MDPI AG
%R 10.3390/a6030485
%X This paper studies the string-excluding (STR-EC)-constrained longest common subsequence (LCS) problem, a generalized LCS problem. For the two input sequences, X and Y , of lengths n andmand a constraint string, P, of length r, the goal is to find the longest common subsequence, Z, of X and Y that excludes P as a substring. The problem and its solution were first proposed by Chen and Chao, but we found that their algorithm cannot solve the problem correctly. A new dynamic programming solution for the STR-EC-LCS problem is then presented in this paper, and the correctness of the new algorithm is proven. The time complexity of the new algorithm is O(nmr).
%K constrained LCS
%K string-excluding
%K dynamic programming
%U http://www.mdpi.com/1999-4893/6/3/485