The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
This book will serve as a reference for seasoned professionals or researchers in the area, while remaining accessible for senior undergraduate students or first year graduate students embarking upon research in compression, pattern matching, full text retrieval, compressed index structures, or other...
| Main Authors: | , , |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston, MA :
Springer US,
2008.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- How the Burrows-Wheeler Transform works
- Coders for the Burrows-Wheeler Transform
- Suffix trees and suffix arrays
- Analysis of the Burrows-Wheeler Transform
- Variants of the Burrows-Wheeler Transform
- Exact and approximate pattern matching
- Other applications of the Burrows-Wheeler Transform
- Conclusion.