Construction of Fundamental Data Structures for Strings

Felipe A. Louza, Simon Gog, Guilherme P. Telles (Autoren)

Buch | Softcover

IX, 104 Seiten

2020 | 1st ed. 2020
Springer International Publishing (Verlag)
978-3-030-55107-0 (ISBN)

Artikel merken

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.

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

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.

"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)

“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)

Erscheinungsdatum	09.10.2020
Reihe/Serie	SpringerBriefs in Computer Science
Zusatzinfo	IX, 104 p. 47 illus., 32 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	189 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Schlagworte	Document array • LCP array • Lyndon array • suffix array • Suffix sorting
ISBN-10	3-030-55107-5 / 3030551075
ISBN-13	978-3-030-55107-0 / 9783030551070
Zustand	Neuware