Computing a Longest Common Palindromic Subsequence

DOI10.3233/FI-2014-974zbMath1310.68267MaRDI QIDQ5411683

Sumaiya Iqbal, Shihabur Rahman Chowdhury, M. Sohel Rahman, Md. Mahbubul Hasan

Publication date: 25 April 2014

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingpalindromesrange querylongest common subsequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Dynamic programming (90C39) Algorithms on strings (68W32)

Related Items (12)

Palindromic subsequence automata and longest common palindromic subsequence ⋮ Longest common rollercoasters ⋮ Computing longest (common) Lyndon subsequences ⋮ A hardness result and new algorithm for the longest common palindromic subsequence problem ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ Longest bordered and periodic subsequences ⋮ On finding a longest common palindromic subsequence ⋮ An \(A^\ast\) search algorithm for the constrained longest common subsequence problem ⋮ Longest property-preserved common factor: a new string-processing framework ⋮ Unnamed Item ⋮ Anytime algorithms for the longest common palindromic subsequence problem

This page was built for publication: Computing a Longest Common Palindromic Subsequence