Palindrome pattern matching

Authors:
I. Tomohiro;Shunsuke Inenaga;Masayuki Takeda
Affiliations:
Department of Informatics, Kyushu University, Fukuoka, Japan;Graduate School of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan;Department of Informatics, Kyushu University, Fukuoka, Japan
Venue:
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Year:
2011

Citing 11
Cited 1

Parameterized pattern matching: algorithms and applications

Journal of Computer and System Sciences
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)
Episturmian words and some constructions of de Luca and Rauzy

Theoretical Computer Science
Palindrome complexity

Theoretical Computer Science
Palindromic richness

European Journal of Combinatorics
Burrows-Wheeler transform and palindromic richness

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
Counting distinct palindromes in a word in linear time

Information Processing Letters
Counting and verifying maximal palindromes

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval

On palindromic sequence automata and applications

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c, r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p) = Pals(t[i : i + m - 1]). We present linear-time algorithms to solve this problem.