On finding longest palindromic subsequences using longest common subsequences
From MaRDI portal
Cites work
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- A linear space algorithm for computing maximal common subsequences
- A Linear-Time n 0.4 -Approximation for Longest Common Subsequence
- A longest common subsequence algorithm suitable for similar text strings
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Algorithms for the Longest Common Subsequence Problem
- Algorithms on Strings, Trees and Sequences
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Computing a Longest Common Palindromic Subsequence
- Fast and compact regular expression matching
- Finding approximate palindromes in strings
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Jewels of Stringology
- Matching Sequences under Deletion/Insertion Constraints
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems
- Palindromic subsequence automata and longest common palindromic subsequence
- Parallel detection of all palindromes in a string
- Quadratic conditional lower bounds for string problems and dynamic time warping
- Searching for gapped palindromes
- The String-to-String Correction Problem
- Tight hardness results for LCS and other sequence similarity measures
This page was built for publication: On finding longest palindromic subsequences using longest common subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253091)
