| The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching Contributor(s): Adjeroh, Donald (Author), Bell, Timothy (Author), Mukherjee, Amar (Author) |
|
 |
ISBN: 1441946284 ISBN-13: 9781441946287 Publisher: Springer OUR PRICE: $104.49 Product Type: Paperback - Other Formats Published: November 2010 |
| Additional Information |
| BISAC Categories: - Computers | Databases - General - Computers | Computer Science - Computers | System Administration - Storage & Retrieval |
| Dewey: 668.423 |
| Physical Information: 0.75" H x 6.14" W x 9.21" (1.12 lbs) 352 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |
