On finding a longest common palindromic subsequence
From MaRDI portal
Publication:1698702
DOI10.1016/J.TCS.2017.02.018zbMath1387.68307OpenAlexW2792511135MaRDI QIDQ1698702
Publication date: 16 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.018
Related Items (4)
Longest common rollercoasters ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ Longest property-preserved common factor: a new string-processing framework ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Parallel detection of all palindromes in a string
- Expected length of the longest common subsequence for large alphabets
- Computing Longest Common Substrings Via Suffix Arrays
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Longest common subsequences of two random sequences
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Algorithms for the Longest Common Subsequence Problem
- Algorithms on Strings, Trees and Sequences
- BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
- String Processing and Information Retrieval
- Computing a Longest Common Palindromic Subsequence
This page was built for publication: On finding a longest common palindromic subsequence