Efficient Data Structures

The chapter is about data structures for text indexing. They are used as fundamental tools in a large amount of algorithms, represented by special arrays and trees associated with texts. The main data structures related to text algorithmics are Suffix trees and automata, Suffix arrays as well as dictionaries of basic factors. All represent all factors of a text in a compact way. For special words they are of a very specific form. Many problems in this chapter are related to such structures with emphasis on their applications. Also de Bruijn graphs are shown as tools for creating special non-trivial words: dense and perfect words.