Details

Autor(en) / Beteiligte

• Rubinchik, Mikhail
• Shur, Arseny M.

Titel

EERTREE: An Efficient Data Structure for Processing Palindromes in Strings

Ist Teil von

• Combinatorial Algorithms, 2016, Vol.9538, p.321-333

Ort / Verlag

Switzerland: Springer International Publishing AG

Erscheinungsjahr

2016

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• 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.