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

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Adjeroh, Donald (Autor), Bell, Timothy (Autor), Mukherjee, Amar (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2008.
Edición:1st ed. 2008.
Temas:
Computer programming.
Database management.
Data structures (Computer science).
Information theory.
Artificial intelligence-Data processing.
Information storage and retrieval systems.
Programming Techniques.
Database Management.
Data Structures and Information Theory.
Data Science.
Information Storage and Retrieval.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares