On palindromic sequence automata and applications

Authors:
Md. Mahbubul Hasan;A. S. M. Sohidull Islam;M. Sohel Rahman;Ayon Sen
Affiliations:
AℓEDA group, Department of CSE, BUET, Dhaka, Bangladesh;AℓEDA group, Department of CSE, BUET, Dhaka, Bangladesh;AℓEDA group, Department of CSE, BUET, Dhaka, Bangladesh;AℓEDA group, Department of CSE, BUET, Dhaka, Bangladesh
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 10
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String

Journal of the ACM (JACM)
Real-time algorithms for string-matching and palindrome recognition

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Online Construction of Subsequence Automata for Multiple Texts

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Efficient algorithms to compute compressed longest common substrings and compressed palindromes

Theoretical Computer Science
Searching for gapped palindromes

Theoretical Computer Science
Finding All Approximate Gapped Palindromes

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finite automata based algorithms on subsequences and supersequences of degenerate strings

Journal of Discrete Algorithms
Palindrome pattern matching

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a novel weighted finite automata called PSA (Palindromic Subsequence Automata) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the LCPS (Longest Common Palindromic Subsequence) problem. Our automata based algorithms are efficient both in theory and in practice.