TY - GEN

T1 - Palindrome pattern matching

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

PY - 2011

Y1 - 2011

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=79960100789&partnerID=8YFLogxK

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

U2 - 10.1007/978-3-642-21458-5_21

DO - 10.1007/978-3-642-21458-5_21

M3 - Conference contribution

AN - SCOPUS:79960100789

SN - 9783642214578

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 232

EP - 245

BT - Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings

PB - Springer Verlag

ER -