Palindromic subsequence automata and longest common palindromic subsequence

DOI10.1007/S11786-016-0288-7MaRDI QIDQ2363997zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsfinite automatapalindromespalindromic subsequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Algorithms on strings (68W32)

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

• A fast algorithm for computing longest common subsequences
• A new efficient algorithm for computing the longest common subsequence
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Algorithms for computing variants of the longest common subsequence problem
• Algorithms on Strings, Trees and Sequences
• Computing a longest common palindromic subsequence
• Doubly-constrained LCS and hybrid-constrained LCS problems revisited
• Efficient algorithms to compute compressed longest common substrings and compressed palindromes
• Finding all approximate gapped palindromes
• Finding all periods and initial palindromes of a string in parallel
• Finding approximate palindromes in strings
• Finite automata based algorithms on subsequences and supersequences of degenerate strings
• scientific article; zbMATH DE number 3569815 (Why is no real title available?)
• Identifying approximate palindromes in run-length encoded strings
• New efficient algorithms for the LCS and constrained LCS problems
• Palindrome pattern matching
• Searching for gapped palindromes

Cited in

(8)

• On finding a longest common palindromic subsequence
• Anytime algorithms for the longest common palindromic subsequence problem
• An efficient algorithm for the longest common palindromic subsequence problem
• Computing a Longest Common Palindromic Subsequence
• scientific article; zbMATH DE number 1962790 (Why is no real title available?)
• On palindromic sequence automata and applications
• Computing a longest common palindromic subsequence
• On finding longest palindromic subsequences using longest common subsequences

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)