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.
Recenzijas
The book is clearly written and structured. The illustrations and examples help readers to understand the presented algorithms. The book is aimed at graduate and PhD students, researchers and practitioners interested in designing and implementing efficient structures for storing and querying string data. (Mihai Gabroveanu, zbMATH 1480.68004, 2022)
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.
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
