On Undetected Redundancy in the Burrows-Wheeler Transform

04/05/2018
by   Uwe Baier, et al.
0

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 BWT-compressor used), making BWT-based compressors competitive or even superior to today's best lossless compressors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2013

k-Modulus Method for Image Transformation

In this paper, we propose a new algorithm to make a novel spatial image ...
research
07/29/2021

A New Lossless Data Compression Algorithm Exploiting Positional Redundancy

A new run length encoding algorithm for lossless data compression that e...
research
11/03/2012

Partition Tree Weighting

This paper introduces the Partition Tree Weighting technique, an efficie...
research
07/11/2016

Fast Cosine Transform to increase speed-up and efficiency of Karhunen-Loeve Transform for lossy image compression

In this work, we present a comparison between two techniques of image co...
research
10/23/2019

Resolution of the Burrows-Wheeler Transform Conjecture

Burrows-Wheeler Transform (BWT) is an invertible text transformation tha...
research
06/27/2023

LeCo: Lightweight Compression via Learning Serial Correlations

Lightweight data compression is a key technique that allows column store...
research
04/25/2016

Fast nonlinear embeddings via structured matrices

We present a new paradigm for speeding up randomized computations of sev...

Please sign up or login with your details

Forgot password? Click here to reset