Construction of Fundamental Data Structures for Strings

Beschreibung

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.

Autor*in

Felipe A. Louza

Themen in »Construction of Fundamental Data Structures for Strings«

Suffix sorting Suffix array LCP array Document array Lyndon array

Stimmen zu »Construction of Fundamental Data Structures for Strings«

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

Details

Link teilen