Construction of Fundamental Data Structures for Strings / by Felipe A. Louza, Simon Gog, Guilherme P. Telles.

Unlimited

Authorized users

Can lend chapters, not whole ebooks

Construction of Fundamental Data Structures for Strings / by Felipe A. Louza, Simon Gog, Guilherme P. Telles.

1st ed. 2020.

3030551083
9783030551087
3030551075
9783030551070

Cham : Springer International Publishing : Imprint: Springer, 2020.

English

1 online resource (IX, 104 pages) : illustrations.

10.1007/978-3-030-55108-7 doi

QA76.9.D35

005.73

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.

Access limited to authorized users.

SpringerBriefs in computer science, 2191-5768

Online Resources > Ebooks
All Resources