We show that both the Lempel–Ziv-77 and the Lempel–Ziv-78 factorization of a text of length
n on an integer alphabet of size σ σ can be computed in O\left (n\right) O n time with either …

We present a new universal source code for distributions of unlabeled binary and ordinal
trees that achieves optimal compression to within lower order terms for all tree sources …

This thesis is dedicated to string processing algorithms and to combinatorics on words. With
respect to the former, we devise Lempel-Ziv (LZ) factorization and sparse suffix sorting …

Abstract The advent of Next-Generation Sequencing brought new challenges for biological
sequence analysis: larger volumes of sequencing data, a proliferation of research projects …

We present a new universal source code for unlabeled binary and ordinal trees that
achieves asymptotically optimal compression for all tree sources covered by existing …