Adjeroh, Donald
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
1. Introduction
2. How the Burrows-Wheeler Transform works
3. Coders for the Burrows-Wheeler Transform
4. Suffix trees and suffix arrays
5. Analysis of the Burrows-Wheeler Transform
6. Variants of the Burrows-Wheeler Transform
7. Exact and approximate pattern matching
8. Other applications of the Burrows-Wheeler Transform
9. Conclusion
DRM-restrictions
Printing: not available
Clipboard copying: not available
Avainsanat: COMPUTERS / Computer Science COM014000
- Tekijä(t)
- Adjeroh, Donald
- Bell, Tim
- Mukherjee, Amar
- Julkaisija
- Springer
- Julkaisuvuosi
- 2008
- Kieli
- en
- Painos
- 1
- Kategoria
- Tietotekniikka, tietoliikenne
- Tiedostomuoto
- E-kirja
- eISBN (PDF)
- 9780387789095