EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
Data Structures and Algorithms
2015-08-18 v2 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.1506.04862,
title = {EERTREE: An Efficient Data Structure for Processing Palindromes in Strings},
author = {Mikhail Rubinchik and Arseny M. Shur},
journal= {arXiv preprint arXiv:1506.04862},
year = {2015}
}
Comments
21 pages, 2 figures. Accepted to IWOCA 2015