New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Parameterized pattern matching: algorithms and applications
Journal of Computer and System Sciences
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Journal of the ACM (JACM)
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Theoretical Computer Science
European Journal of Combinatorics
Burrows-Wheeler transform and palindromic richness
Theoretical Computer Science
Searching for gapped palindromes
Theoretical Computer Science
Finding All Approximate Gapped Palindromes
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Counting distinct palindromes in a word in linear time
Information Processing Letters
| Hi-index | 5.23 |
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.