4 papers
Revisiting the Sparse Matrix Compression Problem
Vincent Jugé, Dominik Köppl, Vincent Limouzy +4
The sparse matrix compression problem asks for a one-dimensional representation of a binary matrix, formed by an integer array of row indices and a shift function f…
Near-real-time Solutions for Online String Problems
Dominik Köppl, Gregory Kucherov
Based on the Breslauer-Italiano online suffix tree construction algorithm (2013) with double logarithmic worst-case guarantees on the update time per letter, we develop near-real-t…
LZD-style Compression Scheme with Truncation and Repetitions
Linus Götz, Dominik Köppl
Lempel-Ziv-Double (LZD) is a variation of the LZ78 compression scheme that achieves better compression on repetitive datasets. Nevertheless, prior research has identified computati…
Hardness Results on Characteristics for Elastic-Degenerated Strings
Dominik Köppl, Jannik Olbrich
Generalizations of plain strings have been proposed as a compact way to represent a collection of nearly identical sequences or to express uncertainty at specific text positions by…