TY - JOUR

T1 - Palindrome pattern matching

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

N1 - Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.

PY - 2013/4/29

Y1 - 2013/4/29

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84876361004&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876361004&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2012.01.047

DO - 10.1016/j.tcs.2012.01.047

M3 - Article

AN - SCOPUS:84876361004

VL - 483

SP - 162

EP - 170

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -