作者
Shihabur Rahman Chowdhury, Md Hasan, Sumaiya Iqbal, M Sohel Rahman
发表日期
2011/10/24
图书
Lecture Notes in Computer Science
卷号
7643
页码范围
219-223
出版商
Springer
简介
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.
学术搜索中的文章
SR Chowdhury, MM Hasan, S Iqbal, MS Rahman - Fundamenta Informaticae, 2014