Advertisement

© 2020

Construction of Fundamental Data Structures for Strings

  • This book features numerous examples, including graphic explanations of sophisticated algorithms that provide a clearer understanding of the main algorithmic ideas for readers interested in the topic of suffix sorting.

  • The main related areas include: Algorithms and Data Structures, String Processing Algorithms and Computational analysis of genomic sequences.

Book

Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

Table of contents

  1. Front Matter
    Pages i-ix
  2. Introduction and Preliminaries

    1. Front Matter
      Pages 1-1
    2. Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 3-8
    3. Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 9-21
    4. Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 23-40
  3. Augmented Suffix Sorting

    1. Front Matter
      Pages 41-41
    2. Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 43-57
    3. Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 59-80
    4. Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 81-95
  4. Conclusions

    1. Front Matter
      Pages 97-97
    2. Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 99-101
  5. Back Matter
    Pages 103-104

About this book

Introduction

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.

Keywords

Suffix sorting Suffix array LCP array Document array Lyndon array

Authors and affiliations

  1. 1.Faculty of Electrical EngineeringFederal University of UberlândiaUberlândiaBrazil
  2. 2.eBay (United States)San JoseUSA
  3. 3.Institute of ComputingUniversity of CampinasCampinasBrazil

About the authors

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

 

Bibliographic information

  • Book Title Construction of Fundamental Data Structures for Strings
  • Authors Felipe A. Louza
    Simon Gog
    Guilherme P. Telles
  • Series Title SpringerBriefs in Computer Science
  • Series Abbreviated Title SpringerBriefs Computer Sci.
  • DOI https://doi.org/10.1007/978-3-030-55108-7
  • Copyright Information The Author(s), under exclusive licence to Springer Nature Switzerland AG 2020
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science Computer Science (R0)
  • Softcover ISBN 978-3-030-55107-0
  • eBook ISBN 978-3-030-55108-7
  • Series ISSN 2191-5768
  • Series E-ISSN 2191-5776
  • Edition Number 1
  • Number of Pages IX, 104
  • Number of Illustrations 15 b/w illustrations, 32 illustrations in colour
  • Topics Data Structures and Information Theory
    Theory of Computation
    Bioinformatics