Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > SANDIP SINHA:
All reports by Author Sandip Sinha:

TR18-141 | 6th August 2018
Sandip Sinha, Omri Weinstein

Local Decodability of the Burrows-Wheeler Transform

Revisions: 1

The Burrows-Wheeler Transform (BWT) is among the most influential discoveries in text compression and DNA storage. It is a \emph{reversible} preprocessing step that rearranges an $n$-letter string into runs of identical characters (by exploiting context regularities), resulting in highly compressible strings, and is the basis for the ubiquitous \texttt{bzip} program. ... more >>>




ISSN 1433-8092 | Imprint