This books reviews recent theoretical and practical advances on suffix sorting and introduces algorithmic solutions to problems of wide interest for the construction of fundamental data structures that operate efficiently on strings namely, constructing the suffix array, the longest common prefix (LCP) array, the document array and the Lyndon array.
These data structures are the cornerstone of many algorithmic solutions in Bioiformatics, Information Retrieval and Data Compression.
This book introduces the relevant problem areas, their importance, the notation and related algorithms and then presents the algorithmic solutions for indexing data structure constructions.
This book is intended for graduate students, researchers and practitioners from Computer Science and Bioinformatics with a strong interest in algorithmic aspects.

This book features numerous examples, including graphic explanations of sophisticated algorithms that provide a clearer understanding of the main algorithmic ideas for readers interested in the topic of suffix sorting. The main related areas include: Algorithms and Data Structures, String Processing Algorithms and Computational analysis of genomic sequences.

Autorentext

Felipe Alves Louza, Dr., Prof., Faculdade de Engenharia Elétrica, Universidade Federal de Uberlândia, Uberlândia - MG, Brazil, 38400-902 Simon Gog, Dr., eBay Inc., San Jose - USA Guilherme Pimentel Telles, Dr., Prof., Instituto de Computação, Universidade Estadual de Campinas, Campinas - SP, Brazil, 13083-852

Inhalt
Part I. Introduction and Preliminaries.- 1. Introduction.- 2. Background.- 3. Induced Suffix Sorting.- Part II. Augmented Suffix Sorting.- 4. Inducing the LCP Array.- 5. Inducing the Document Array.- 6. Inducing the Lyndon Array.- Part III. Conclusions.- 7. Conclusions.- Index.