Construction of Fundamental Data Structures for Strings
Louza, Felipe A.
Construction of Fundamental Data Structures for Strings [electronic resource] / by Felipe A. Louza, Simon Gog, Guilherme P. Telles. - 1st ed. 2020. - IX, 104 p. 47 illus., 32 illus. in color. online resource. - SpringerBriefs in Computer Science, 2191-5776 . - SpringerBriefs in Computer Science, .
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. .
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.
9783030551087
10.1007/978-3-030-55108-7 doi
Data structures (Computer science).
Information theory.
Algorithms.
Bioinformatics.
Data Structures and Information Theory.
Design and Analysis of Algorithms.
Bioinformatics.
QA76.9.D35 Q350-390
005.73 003.54
Construction of Fundamental Data Structures for Strings [electronic resource] / by Felipe A. Louza, Simon Gog, Guilherme P. Telles. - 1st ed. 2020. - IX, 104 p. 47 illus., 32 illus. in color. online resource. - SpringerBriefs in Computer Science, 2191-5776 . - SpringerBriefs in Computer Science, .
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. .
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.
9783030551087
10.1007/978-3-030-55108-7 doi
Data structures (Computer science).
Information theory.
Algorithms.
Bioinformatics.
Data Structures and Information Theory.
Design and Analysis of Algorithms.
Bioinformatics.
QA76.9.D35 Q350-390
005.73 003.54