Computing a Longest Common Palindromic Subsequence
The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science. Palindrome is a string, which reads the same forward as it does backward. The longest common palindromic subsequence (LCPS) problem is an interesting variant of the classic LCS problem which finds the longest common subsequence between two given strings such that the computed subsequence is also a palindrome. In this paper, we study the LCPS problem and give efficient algorithms to solve this problem. To the best of our knowledge, this is the first attempt to study and solve this interesting problem.
KeywordsLongest common subsequence Palindromes Dynamic programming Range query
Unable to display preview. Download preview PDF.
- 3.Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New YorkGoogle Scholar
- 6.Kolpakov, R., Kucherov, G.: Searching for gapped palindromes. Theoretical Computer Science, 5365–5373 (November 2009)Google Scholar