Palindromic subsequence automata and longest common palindromic subsequence
From MaRDI portal
Publication:2363997
DOI10.1007/S11786-016-0288-7zbMATH Open1370.68172OpenAlexW2583611270MaRDI QIDQ2363997FDOQ2363997
Authors: Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen 
Publication date: 17 July 2017
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-016-0288-7
Recommendations
- On palindromic sequence automata and applications
- On finding a longest common palindromic subsequence
- Computing a longest common palindromic subsequence
- Computing Longest Common Substring and All Palindromes from Compressed Strings
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Cites Work
- Algorithms on Strings, Trees and Sequences
- Finding all periods and initial palindromes of a string in parallel
- A fast algorithm for computing longest common subsequences
- Algorithms for computing variants of the longest common subsequence problem
- Searching for gapped palindromes
- Palindrome pattern matching
- Finding all approximate gapped palindromes
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- A new efficient algorithm for computing the longest common subsequence
- New efficient algorithms for the LCS and constrained LCS problems
- Finding approximate palindromes in strings
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
- Title not available (Why is that?)
- Identifying approximate palindromes in run-length encoded strings
- Computing a longest common palindromic subsequence
Cited In (7)
- An efficient 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 a longest common palindromic subsequence
- Title not available (Why is that?)
- On palindromic sequence automata and applications
This page was built for publication: Palindromic subsequence automata and longest common palindromic subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363997)
