| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436842 | Theoretical Computer Science | 2013 | 9 Pages |
Abstract
A palindrome is a string that reads the same forward and backward. For a string x, let be the set of all maximal palindromes of x, where each maximal palindrome in 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 . We present linear-time algorithms to solve this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
