On Undetected Redundancy in the Burrows-Wheeler Transform

@inproceedings{Baier2018OnUR,
  title={On Undetected Redundancy in the Burrows-Wheeler Transform},
  author={Uwe Baier},
  booktitle={CPM},
  year={2018}
}
The Burrows-Wheeler-Transform (BWT) is an invertible permutation of a text known to be highly compressible but also useful for sequence analysis, what makes the BWT highly attractive for lossless data compression. In this paper, we present a new technique to reduce the size of a BWT using its combinatorial properties, while keeping it invertible. The technique can be applied to any BWT-based compressor, and, as experiments show, is able to reduce the encoding size by 8 − 16% on average and up… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

7zip File Compressor

  • Igor Pavlov
  • http://www.7-zip.org/. last visited January
  • 2018

Large Text Compression Benchmark

  • Matt Mahoney
  • http://mattmahoney.net/dc/text. html. last…
  • 2018

Repetitive Corpus. http://pizzachili.dcc

  • Paolo Ferragina, Gonzalo Navarro
  • uchile.cl/repcorpus.html. last visited January
  • 2018

Silesia Corpus. http://sun.aei.polsl.pl/~sdeor/index.php? page=silesia. last visited January 2018

  • Sebastian Deorowicz
  • 2018

Tunneled BWT Implementation and Benchmark. https://github.com/ waYne1337/tbwt

  • Uwe Baier
  • 2018

sdsl-lite Library. https://github.com/simongog/sdsl-lite. last visited January 2018

  • Simon Gog
  • 2018

zpaq File Compressor

  • Matt Mahoney
  • http://mattmahoney.net/dc/zpaq.html. last visited…
  • 2018

Similar Papers

Loading similar papers…