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 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 commo...

Full description

Saved in:
Bibliographic Details
Published inFundamenta informaticae Vol. 129; no. 4; pp. 329 - 340
Main Authors Chowdhury, Shihabur Rahman, Hasan, Md. Mahbubul, Iqbal, Sumaiya, Rahman, M. Sohel
Format Journal Article
LanguageEnglish
Published 2014
Subjects
Algorithms
Computation
Liquid crystal polymers
Strings
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0169-2968
DOI:10.3233/FI-2014-974