Computing a Longest Common Palindromic Subsequence

Details Computing a Longest Common Palindromic Subsequence Computing a Longest Common Palindromic Subsequence

2011-10-24

arxiv.org/abs/1110.5296v1

Computer Science

Data Structures and Algorithms

Scientific paper

The {\em 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 {\em 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.

Affiliated with

Also associated with

No associations

Rating

Computing a Longest Common Palindromic Subsequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing a Longest Common Palindromic Subsequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing a Longest Common Palindromic Subsequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521050