Book contents
- Frontmatter
- Dedication
- Contents
- List of insights
- Preface
- Notation
- Part I Preliminaries
- 1 Molecular biology and high-throughput sequencing
- 2 Algorithm design
- 3 Data structures
- 4 Graphs
- 5 Network flows
- Part II Fundamentals of Biological Sequence Analysis
- Part III Genome-Scale Index Structures
- Part IV Genome-Scale Algorithms
- Part V Applications
- References
- Index
3 - Data structures
from Part I - Preliminaries
Published online by Cambridge University Press: 28 September 2023
- Frontmatter
- Dedication
- Contents
- List of insights
- Preface
- Notation
- Part I Preliminaries
- 1 Molecular biology and high-throughput sequencing
- 2 Algorithm design
- 3 Data structures
- 4 Graphs
- 5 Network flows
- Part II Fundamentals of Biological Sequence Analysis
- Part III Genome-Scale Index Structures
- Part IV Genome-Scale Algorithms
- Part V Applications
- References
- Index
Summary
This chapter presents the minimal setup of data structures required to follow the rest of the book in a self-contained manner. Balanced binary trees are enhanced to solve dynamic range minimum queries. Bitvector rank and select data structures and their extensions to larger alphabets with wavelet tree are covered. Then a special structure for solving static range minimum queries is derived. The chapter ends with a concise description of hashing primitives, such as perfect hashing, Bloom filters, minimizers, and the Rabin–Karp rolling hash.
- Type
- Chapter
- Information
- Genome-Scale Algorithm DesignBioinformatics in the Era of High-Throughput Sequencing, pp. 21 - 41Publisher: Cambridge University PressPrint publication year: 2023