๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching

โœ Scribed by Donald Adjeroh, Timothy Bell, Amar Mukherjee


Publisher
Springer
Year
2008
Tongue
English
Leaves
353
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The Burrows-Wheeler Transform is one of the best lossless compression me- ods available. It is an intriguing โ€• even puzzling โ€• approach to squeezing redundancy out of data, it has an interesting history, and it has applications well beyond its original purpose as a compression method. It is a relatively late addition to the compression canon, and hence our motivation to write this book, looking at the method in detail, bringing together the threads that led to its discovery and development, and speculating on what future ideas might grow out of it. The book is aimed at a wide audience, ranging from those interested in learning a little more than the short descriptions of the BWT given in st- dard texts, through to those whose research is building on what we know about compression and pattern matching. The ?rst few chapters are a careful description suitable for readers with an elementary computer science ba- ground (and these chapters have been used in undergraduate courses), but later chapters collect a wide range of detailed developments, some of which are built on advanced concepts from a range of computer science topics (for example, some of the advanced material has been used in a graduate c- puter science course in string algorithms). Some of the later explanations require some mathematical sophistication, but most should be accessible to those with a broad background in computer science.


๐Ÿ“œ SIMILAR VOLUMES


The Burrows-Wheeler Transform: Data Comp
โœ Donald Adjeroh, Timothy Bell, Amar Mukherjee ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Springer ๐ŸŒ English

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 compre

The Burrows-Wheeler Transform: Data Comp
โœ Donald Adjeroh, Timothy Bell, Amar Mukherjee ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐ŸŒ English

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 compre

The transform and data compression handb
โœ Rao K.R., Yip P.C. (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐Ÿ› CRC ๐ŸŒ English

Data compression is one of the main contributing factors in the explosive growth in information technology. Without it, a number of consumer and commercial products, such as DVD, videophone, digital camera, MP3, video-streaming and wireless PCS, would have been virtually impossible. Transforming the

The Transform and Data Compression Handb
โœ Kamisetty Ramam Rao, Patrick C. Yip ๐Ÿ“‚ Library ๐Ÿ“… 2000 ๐Ÿ› CRC Press ๐ŸŒ English

Data compression is one of the main contributing factors in the explosive growth in information technology. Without it, a number of consumer and commercial products, such as DVD, videophone, digital camera, MP3, video-streaming and wireless PCS, would have been virtually impossible. Transforming the

The transform and data compression handb
โœ Kamisetty Ramam Rao, Pat Yip ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐Ÿ› CRC Press ๐ŸŒ English

Data compression is one of the main contributing factors in the explosive growth in information technology. Without it, a number of consumer and commercial products, such as DVD, videophone, digital camera, MP3, video-streaming and wireless PCS, would have been virtually impossible. Transforming the