Computing a Longest Common Palindromic Subsequence

@article{Chowdhury2014ComputingAL,
  title={Computing a Longest Common Palindromic Subsequence},
  author={Shihabur Rahman Chowdhury and Md. Mahbubul Hasan and Sumaiya Iqbal and Mohammad Sohel Rahman},
  journal={Fundam. Inform.},
  year={2014},
  volume={129},
  pages={329-340}
}
The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science. Palindrome is a string, which reads the same forward as it does backward. The 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… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Palindrome pattern matching

Theor. Comput. Sci. • 2013
View 1 Excerpt

Architecture model for approximate palindrome detection

2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems • 2009

Hardware acceleration of approximate palindromes searching

2008 International Conference on Field-Programmable Technology • 2008

Similar Papers

Loading similar papers…