0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

The Burrows-Wheeler Transform: - Data Compression, Suffix Arrays, and Pattern Matching (Hardcover, 2008 ed.) Loot Price: R3,081
Discovery Miles 30 810
The Burrows-Wheeler Transform: - Data Compression, Suffix Arrays, and Pattern Matching (Hardcover, 2008 ed.): Donald Adjeroh,...

The Burrows-Wheeler Transform: - Data Compression, Suffix Arrays, and Pattern Matching (Hardcover, 2008 ed.)

Donald Adjeroh, Timothy Bell, Amar Mukherjee

 (sign in to rate)
Loot Price R3,081 Discovery Miles 30 810 | Repayment Terms: R289 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Release date: July 2008
First published: 2008
Authors: Donald Adjeroh • Timothy Bell • Amar Mukherjee
Dimensions: 235 x 155 x 25mm (L x W x T)
Format: Hardcover
Pages: 352
Edition: 2008 ed.
ISBN-13: 978-0-387-78908-8
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Promotions
LSN: 0-387-78908-1
Barcode: 9780387789088

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Data Abstraction and Problem Solving…
Janet Prichard, Frank Carrano Paperback R2,421 Discovery Miles 24 210
Gamma Solution - An Application of…
James R Warren Hardcover R1,338 R1,131 Discovery Miles 11 310
Coding for Kids in Python - Python…
Bob Mather Hardcover R917 Discovery Miles 9 170
C Programming - C Programming Language…
Adam Dodson Hardcover R598 R542 Discovery Miles 5 420
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,817 Discovery Miles 38 170
Image Analysis, Classification and…
Morton John Canty Paperback R1,540 Discovery Miles 15 400
MATLAB Applications in Engineering
Constantin Volosencu Hardcover R3,310 Discovery Miles 33 100
The Application of Ant Colony…
Ali Soofastaei Hardcover R2,765 Discovery Miles 27 650
Python Programming for Computations…
Computer Language Hardcover R1,216 R1,024 Discovery Miles 10 240
Genetic Algorithms with Python
Clinton Sheppard Hardcover R911 R858 Discovery Miles 8 580
Dual-Pivot Quicksort and Beyond…
Sebastian Wild Hardcover R1,311 Discovery Miles 13 110
The Physics of Computing
Marilyn Wolf Paperback R1,745 Discovery Miles 17 450

See more

Partners