The burrows-wheeler transform: data compression, suffix arrays, and pattern matching

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 as a reference for seasoned professionals and researchers in the area, while providing a gentle introduction that makes it 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 areas related to the BWT. Comprehensive resource for information related to different aspects of the Burrows-Wheeler Transform Explores non-traditional applications of the BWT Tutorial materials ideal for classroom use on courses in: (1) Data Compression and Source Coding, (2) Modern Information Retrieval, (3) Information Science, (4) Digital Libraries INDICE: Introduction.- How the Burrows-Wheeler Transform works.- Coders for the Burrows-Wheeler Transform.- Suffix trees and suffix arrays.- Suffix Trees.- 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.- Notation.- Ongoing work on the Burrows-Wheeler Transform.- BWT-related web sites.- Ph.D. theses relating to the Burrows-Wheeler Transform.- References.- Index.

• ISBN: 978-0-387-78908-8
• Editorial: Springer
• Encuadernacion: Cartoné
• Páginas: 352
• Fecha Publicación: 01/08/2008
• Nº Volúmenes: 1
• Idioma: Inglés