An efficient algorithm for the longest common palindromic subsequence problem

DOI10.1016/j.tcs.2022.04.046OpenAlexW4225137569MaRDI QIDQ2672607

Chang-Biau Yang, Kuo-Si Huang, Ting-Wei Liang

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.046

zbMATH Keywords

longest common subsequencediagonal methodlongest common palindromic subsequence3-D domination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A subquadratic algorithm for minimum palindromic factorization
• Counting distinct palindromes in a word in linear time
• Fast algorithms for computing the constrained LCS of run-length encoded strings
• Faster algorithms for computing longest common increasing subsequences
• A fast algorithm for computing a longest common increasing subsequence
• New efficient algorithms for the LCS and constrained LCS problems
• The constrained longest common subsequence problem
• A longest common subsequence algorithm suitable for similar text strings
• Efficient merged longest common subsequence algorithms for similar sequences
• On finding a longest common palindromic subsequence
• Finding approximate palindromes in strings
• The generalized definitions of the two-dimensional largest common substructure problems
• A diagonal-based algorithm for the longest common increasing subsequence problem
• Palindromic subsequence automata and longest common palindromic subsequence
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• On Finding the Maxima of a Set of Vectors
• Palindromic length in linear time
• Computing Palindromic Factorizations and Palindromic Covers On-line
• Computing a Longest Common Palindromic Subsequence

This page was built for publication: An efficient algorithm for the longest common palindromic subsequence problem