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
CITATION STYLE
Rubinchik, M., & Shur, A. M. (2016). EERTREE: An efficient data structure for processing palindromes in strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9538, pp. 321–333). Springer Verlag. https://doi.org/10.1007/978-3-319-29516-9_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
