## A space efficient algorithm for the longest common subsequence in k-length substrings

- Daxin Zhu, Lei Wang, Tinran Wang, Xiaodong Wang
- Theor. Comput. Sci.
- 2017

- Published 2013 in Inf. Process. Lett.
DOI:10.1016/j.ipl.2013.07.005

In this paper, we consider a generalized longest common subsequence problem, the string-excluding constrained LCS problem. For the two input sequences X and Y of lengths n and m, and a constraint string P of length r, the problem is to find a common subsequence Z of X and Y excluding P as a substring and the length of Z is maximized. The problem and its… CONTINUE READING

### Presentations referencing similar topics