EERTREE: An Efficient Data Structure for Processing Palindromes in Strings

TL;DR

The paper introduces EERTREE, a linear-size data structure that efficiently manages all palindromic substrings in strings, enabling faster solutions for palindrome-related problems.

Contribution

It presents a novel data structure, EERTREE, combining ideas from suffix tries and suffix trees to efficiently process palindromes in strings.

Findings

Linear size of the data structure

Fast access to all palindromic substrings

Simplified solutions for palindrome problems

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.