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

Author:   Donald Adjeroh ,  Timothy Bell ,  Amar Mukherjee
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of hardcover 1st ed. 2008
ISBN:  

9781441946287


Pages:   352
Publication Date:   04 November 2010
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $419.76 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

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.

Full Product Details

Author:   Donald Adjeroh ,  Timothy Bell ,  Amar Mukherjee
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of hardcover 1st ed. 2008
Dimensions:   Width: 15.50cm , Height: 1.90cm , Length: 23.50cm
Weight:   0.557kg
ISBN:  

9781441946287


ISBN 10:   1441946284
Pages:   352
Publication Date:   04 November 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

From the reviews: The focus of the book, the Burrows-Wheeler transform (BWT), is an algorithm ! used in data compression and pattern matching. ! A major strength of the book is the clear writing style and the easy-to-follow flow. ! On one hand, a student or faculty will discover theoretical topics related to information theory and pattern recognition. On the other, computational scientists will be attracted to the many applications of the BWT transform. All in all, it is a worthwhile lecture. (Stefan Robila, ACM Computing Reviews, November, 2008) This book exposes the reader to many applications of the Burrows-Wheeler Transform ! . This book invites the reader to explore a new topic. ! I can recommend this text to a wide variety of readers. This book is well suited for a researcher ! who seeks to understand the Burrows-Wheeler Transform and its many applications to existing framework of algorithms. ! This would be a wonderful course textbook since its coverage is comprehensive ! . Many computer scientists can gain from reading this book. (Shoshana Neuburger, SIGACT News, Vol. 41 (1), 2010)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List