|
| Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt. |
The Burrows-Wheeler Transform:
Data Compression, Suffix Arrays, and Pattern Matching
Sofort lieferbar | Lieferzeit: Sofort lieferbar I
ISBN-13:
9780387789095
Veröffentl:
2008
Seiten:
352
Autor:
Donald Adjeroh
eBook Typ:
PDF
eBook Format:
EPUB
Kopierschutz:
1 - PDF Watermark
Sprache:
Englisch
Beschreibung:
This book will serve as a reference for seasoned professionals or researchers in the area, while remaining 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.
"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.
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.
Kunden Rezensionen
Mehr zum Thema
Folgen Sie uns auf:
