Skip to main content
SpringerLink
Log in

Construction of Fundamental Data Structures for Strings

  • Book
  • © 2020

Overview

Authors:
  1. Felipe A. Louza

    1. Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, Brazil

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Simon Gog

    1. eBay (United States), San Jose, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Guilherme P. Telles

    1. Institute of Computing, University of Campinas, Campinas, Brazil

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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.

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages i-ix
    Download chapter PDF

  2. Introduction and Preliminaries

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Introduction

      • Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 3-8

    3. Background

      • Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 9-21

    4. Induced Suffix Sorting

      • Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 23-40

  3. Augmented Suffix Sorting

    1. Front Matter

      Pages 41-41
      Download chapter PDF

    2. Inducing the LCP Array

      • Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 43-57

    3. Inducing the Document Array

      • Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 59-80

    4. Inducing the Lyndon Array

      • Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 81-95

  4. Conclusions

    1. Front Matter

      Pages 97-97
      Download chapter PDF

    2. Conclusions

      • Felipe A. Louza, Simon Gog, Guilherme P. Telles
      Pages 99-101

  5. Back Matter

    Pages 103-104
    Download chapter PDF
Back to top

Keywords

About this book

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.

Reviews

“The book is clearly written and structured. The illustrations and examples help readers to understand the presented algorithms. … The book is aimed at graduate and PhD students, researchers and practitioners interested in designing and implementing efficient structures for storing and querying string data.” (Mihai Gabroveanu, zbMATH 1480.68004, 2022)

Authors and Affiliations

  • Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, Brazil

    Felipe A. Louza

  • eBay (United States), San Jose, USA

    Simon Gog

  • Institute of Computing, University of Campinas, Campinas, Brazil

    Guilherme P. Telles

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

  • DOI: https://doi.org/10.1007/978-3-030-55108-7

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

  • Softcover ISBN: 978-3-030-55107-0Published: 08 October 2020

  • eBook ISBN: 978-3-030-55108-7Published: 07 October 2020

  • 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

Publish with us

Policies and ethics

Back to top

Search

Navigation