Cover Image

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 (L...

Full description

Main Authors: Louza, Felipe A. (Author, http://id.loc.gov/vocabulary/relators/aut), Gog, Simon. (http://id.loc.gov/vocabulary/relators/aut), Telles, Guilherme P. (http://id.loc.gov/vocabulary/relators/aut)
Corporate Author: SpringerLink (Online service)
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2020.
Edition:1st ed. 2020.
Series:SpringerBriefs in Computer Science,
Subjects:
Data structures (Computer science).
Computers.
Bioinformatics.
Data Structures and Information Theory.
Theory of Computation.
Online Access:https://doi.org/10.1007/978-3-030-55108-7
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. .

Similar Items