Construction of Fundamental Data Structures for Strings

Book Overview

This book 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.

Applications

These data structures are the cornerstone of many algorithmic solutions in Bioinformatics, Information Retrieval and Data Compression.

Content Description

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.

Intended Audience

This book is intended for graduate students, researchers and practitioners from Computer Science and Bioinformatics with a strong interest in algorithmic aspects.