Construction of Fundamental Data Structures for Strings
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.
1137321153
Construction of Fundamental Data Structures for Strings
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.
59.99 In Stock
Construction of Fundamental Data Structures for Strings

Construction of Fundamental Data Structures for Strings

Construction of Fundamental Data Structures for Strings

Construction of Fundamental Data Structures for Strings

eBook1st ed. 2020 (1st ed. 2020)

$59.99 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9783030551087
Publisher: Springer-Verlag New York, LLC
Publication date: 10/07/2020
Series: SpringerBriefs in Computer Science
Sold by: Barnes & Noble
Format: eBook
File size: 12 MB
Note: This product may take a few minutes to download.

About the Author

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

 

Table of Contents

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. 
From the B&N Reads Blog

Customer Reviews