Palindrome pattern matching

Tomohiro I, Shunsuke Inenaga, Masayuki Takeda

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)162-170
Number of pages9
JournalTheoretical Computer Science
Publication statusPublished - Apr 29 2013

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Palindrome pattern matching'. Together they form a unique fingerprint.

Cite this