Computing a longest common palindromic subsequence
From MaRDI portal
Recommendations
- Computing a Longest Common Palindromic Subsequence
- On finding a longest common palindromic subsequence
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- A new efficient algorithm for computing the longest common subsequence
- Palindromic subsequence automata and longest common palindromic subsequence
Cited in
(16)- Longest substring palindrome after edit
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
- Palindromic subsequence automata and longest common palindromic subsequence
- Longest bordered and periodic subsequences
- An efficient algorithm for the longest common palindromic subsequence problem
- Computing longest common square subsequences
- Longest common rollercoasters
- Computing longest palindromic substring after single-character or block-wise edits
- Longest property-preserved common factor: a new string-processing framework
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- Anytime algorithms for the longest common palindromic subsequence problem
- Computing a Longest Common Palindromic Subsequence
- On finding a longest common palindromic subsequence
- Computing longest (common) Lyndon subsequences
- Online algorithms on antipowers and antiperiods
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
This page was built for publication: Computing a longest common palindromic subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411683)
