Affiliations: AlEDA group, Department of CSE, Bangladesh University of Engineering & Technology, Dhaka - 1000, Bangladesh. {shihab, mahbub86, sumaiya, msrahman}@cse.buet.ac.bd
Note: [] Partially supported by a Commonwealth Fellowship and an ACU Titular Fellowship Address for correspondence: AlEDA group, Department of CSE, Bangladesh University of Engineering & Technology, Dhaka - 1000, Bangladesh
Abstract: The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science. Palindrome is a word which reads the same forward as it does backward. The longest common palindromic subsequence (LCPS) problem is a variant of the classic LCS problem which finds a 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 two novel algorithms to solve it. To the best of our knowledge, this is the first attempt to study and solve this problem.
Keywords: longest common subsequence, palindromes, dynamic programming, range query
