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

• Κύριοι συγγραφείς: Adjeroh, Donald (Συγγραφέας), Bell, Tim (Συγγραφέας), Mukherjee, Amar (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US, 2008.
• Θέματα: Computer science.; Computer programming.; Data structures (Computer science).; Database management.; Information storage and retrieval.; Computer Science.; Programming Techniques.; Database Management.; Data Structures, Cryptology and Information Theory.; Data Structures.; Information Storage and Retrieval.

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...

Πίνακας περιεχομένων:

• 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.