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.
| Original language | English |
|---|---|
| Pages (from-to) | 162-170 |
| Number of pages | 9 |
| Journal | Theoretical Computer Science |
| Volume | 483 |
| DOIs | |
| Publication status | Published - Apr 29 2013 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Palindrome pattern matching. / I, Tomohiro; Inenaga, Shunsuke; Takeda, Masayuki.
In: Theoretical Computer Science, Vol. 483, 29.04.2013, p. 162-170.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Palindrome pattern matching
AU - I, Tomohiro
AU - Inenaga, Shunsuke
AU - Takeda, Masayuki
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
VL - 483
SP - 162
EP - 170
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
ER -