Motivation In recent years, the focus of bioinformatics research has moved from individual
sequences to collections of sequences. Given the fundamental role of the Burrows-Wheeler …

While the th order empirical entropy is an accepted measure of the compressibility of
individual sequences on classical text collections, it is useful only for small values of and …

In recent years, the focus of bioinformatics research has moved from individual sequences to
collections of sequences. Given the fundamental role of the Burrows-Wheeler Transform …

A bit catastrophe, loosely defined, is when a change in just one character of a string causes
a significant change in the size of the compressed string. We study this phenomenon for the …

Abstract The Bijective Burrows-Wheeler Transform (BBWT) is a variant of the famous BWT
[Burrows and Wheeler, 1994]. The BBWT was introduced by Gil and Scott in 2012, and is …

We explore an extension to straight-line programs (SLPs) that outperforms, for some text
families, the measure δ based on substring complexity, a lower bound for most measures …

Morphisms are widely studied combinatorial objects that can be used for generating infinite
families of words. In the context of Information theory, injective morphisms are called …

We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that
for any string w, a bidirectional macro scheme of size O (r B) can be induced from the BBWT …

Repetitiveness measures reveal profound characteristics of datasets, and give rise to
compressed data structures and algorithms working in compressed space. Alas, the …

We consider the problem of maintaining the size of the LZ77 factorization of a string S of
length at most n under the following operations:(a) appending a given letter to S and (b) …