Back to Search
Start Over
Computing a Longest Common Palindromic Subsequence.
- Source :
-
Fundamenta Informaticae . 2014, Vol. 129 Issue 4, p329-340. 12p. - Publication Year :
- 2014
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01692968
- Volume :
- 129
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Fundamenta Informaticae
- Publication Type :
- Academic Journal
- Accession number :
- 94277792
- Full Text :
- https://doi.org/10.3233/FI-2014-974