Published online by Cambridge University Press: 10 June 2021
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.
To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.