%0 Journal Article
%T EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
%A Mikhail Rubinchik
%A Arseny M. Shur
%J Computer Science
%D 2015
%I arXiv
%X We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure, we present simple and efficient solutions for a number of problems involving palindromes.
%U http://arxiv.org/abs/1506.04862v2