The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching / by Donald Adjeroh, Tim Bell, Amar Mukherjee.

Springer eBooks

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.

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 areas related to the BWT. Key features include a comprehensive resource for information related to different aspects of the Burrows-Wheeler Transform, an exploration of non-traditional applications of the BWT in areas such as Bioinformatics, test data compression for systems-on-chip and multimedia information retrieval, and tutorial materials ideal for classroom use. Advance Praise for The Burrows-Wheeler Transform: "A thorough discussion of the Burrows-Wheeler Transform and its many connections to pattern-matching and data compression is long overdue. This fascinating, comprehensive monograph fills a gap: a ‘must-read’ for researchers in bioinformatics and computer science". -- Professor Bill Smyth, McMaster University, Canada "A much-needed book providing the first complete coverage of the principles and applications of a fascinating tool. The exposition is rigorous but still easy to follow. I heartily recommend this book to anyone interested in data compression or string algorithms". -- Professor Giovanni Manzini, Università del Piemonte Orientale, Italy

Para consulta fuera de la UANL se requiere clave de acceso remoto.