Novel and Generalized Sort-Based Transform for Lossless Data Compression
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
Extension and faster implementation of the GRP transform for lossless compression
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Medium-space algorithms for inverse BWT
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Computing the inverse sort transform in linear time
ACM Transactions on Algorithms (TALG)
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Lightweight BWT construction for very large string collections
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Seed-set construction by equi-entropy partitioning for efficient and sensitive short-read mapping
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Information and Computation
Parameterized longest previous factor
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
p-Suffix sorting as arithmetic coding
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor
Theoretical Computer Science
A linearly computable measure of string complexity
Theoretical Computer Science
Revisiting bounded context block-sorting transformations
Software—Practice & Experience
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
p-Suffix sorting as arithmetic coding
Journal of Discrete Algorithms
Computing regularities in strings: A survey
European Journal of Combinatorics
Lyndon fountains and the Burrows-Wheeler transform
Proceedings of the CUBE International Information Technology Conference
Comparing DNA sequence collections by direct comparison of compressed text indexes
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Grammar precompression speeds up burrows---wheeler compression
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
A dynamic pipeline for RNA sequencing on multicore processors
Proceedings of the 20th European MPI Users' Group Meeting
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Predicting Protein Families using Protein Shape Context
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Journal of Discrete Algorithms
| Hi-index | 0.00 |
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 or researchers in the area, while providing a gentle introduction, making 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. Key Features Comprehensive resource for information related to different aspects of the Burrows-Wheeler Transform including: Gentle introduction to the BWT History of the development of the BWT Detailed theoretical analysis of algorithmic issues and performance limits Searching on BWT compressed data Hardware architectures for the BWT Explores non-traditional applications of the BWT in areas such as: Bioinformatics Joint source-channel coding Modern information retrieval Machine translation Test data compression for systems-on-chip Teaching materials ideal for classroom use on courses in: Data Compression and Source Coding Modern Information Retrieval Information Science Digital Libraries