Local decodability of the Burrows-Wheeler transform

@article{Sinha2018LocalDO,
  title={Local decodability of the Burrows-Wheeler transform},
  author={Sandip Sinha and Omri Weinstein},
  journal={Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
  year={2018}
}
  • Sandip Sinha, Omri Weinstein
  • Published 2018
  • Computer Science, Mathematics
  • Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
  • The Burrows-Wheeler Transform (BWT) is among the most influential discoveries in text compression and DNA storage. It is a 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 of the bzip compression program. Alas, the decoding process of BWT is inherently sequential and requires Ω(n) time even to retrieve a single character. We study the succinct data… CONTINUE READING
    1
    Twitter Mention

    Figures and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    Compression of individual sequences via variable-rate coding

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    A Block-sorting Lossless Data Compression Algorithm

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Cell probe lower bounds for succinct data structures

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Indexing Compressed Text

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Local Decodability of the Burrows- Wheeler Transform

    • Sandip Sinha, Omri Weinstein
    • 2018
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL