| Description |
1 online resource (xxii, 351 pages) : illustrations |
| Series |
Springer series in statistics |
|
Springer series in statistics.
|
| Contents |
Introduction; 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 |
| Summary |
The Burrows-Wheeler Transform is a text transformation scheme that has found applications in different aspects of the data explosion problem, from data compression to index structures and search. The BWT belongs to a new class of compression algorithms, distinguished by its ability to perform compression by sorted contexts. More recently, the BWT has also found various applications in addition to text data compression, such as in lossless and lossy image compression, tree-source identification, bioinformatics, machine translation, shape matching, and test data compression. This book will serve |
| Bibliography |
Includes bibliographical references (pages 317-339) and index |
| Notes |
Print version record |
| Subject |
Data compression (Computer science)
|
|
COMPUTERS -- Desktop Applications -- Databases.
|
|
COMPUTERS -- Database Management -- General.
|
|
COMPUTERS -- System Administration -- Storage & Retrieval.
|
|
Data compression (Computer science)
|
|
Informatique.
|
|
Data compression (Computer science)
|
| Form |
Electronic book
|
| Author |
Bell, Timothy C.
|
|
Mukherjee, Amar.
|
| ISBN |
9780387789095 |
|
038778909X |
|
9780387789088 |
|
0387789081 |
|
