Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.tcs.2012.01.047 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
palindrome pattern,maximal palindrome,radius r,Palindrome pattern matching,center c,linear-time algorithm,length n,pattern p,positions i,length m | Journal | 483, |
ISSN | Citations | PageRank |
0304-3975 | 2 | 0.39 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomohiro I | 1 | 148 | 22.06 |
| Shunsuke Inenaga | 2 | 595 | 79.02 |
| Masayuki Takeda | 3 | 902 | 79.24 |