Louza / Gog / Telles Construction of Fundamental Data Structures for Strings

1. Auflage 2020
ISBN: 978-3-030-55108-7
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 104 Seiten, eBook

Reihe: SpringerBriefs in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Louza, Felipe A.

Gog, Simon

Telles, Guilherme P.

Inhaltsverzeichnis

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.

Über Autor(innen)

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