11 citations · 12 across the 4 of their papers we have counts for
6 papers
RLZ-r and LZ-End-r: Enhancing Move-r
Patrick Dinklage, Johannes Fischer, Lukas Nalbach +1
In pattern matching on strings, a locate query asks for an enumeration of all the occurrences of a given pattern in a given text. The r-index [Gagie et al., 2018] is a recently pre…
Computing the LZ-End parsing: Easy to implement and practically efficient
Patrick Dinklage
The LZ-End parsing [Kreft & Navarro, 2011] of an input string yields compression competitive with the popular Lempel-Ziv 77 scheme, but also allows for efficient random access. Kem…
Engineering Predecessor Data Structures for Dynamic Integer Sets
Patrick Dinklage, Johannes Fischer, Alexander Herlez
We present highly optimized data structures for the dynamic predecessor problem, where the task is to maintain a set of -bit numbers under insertions, deletions, and predece…
Translating Between Wavelet Tree and Wavelet Matrix Construction
Patrick Dinklage
The wavelet tree (Grossi et al. [SODA, 2003]) and wavelet matrix (Claude et al. [Inf. Syst., 2015]) are compact data structures with many applications such as text indexing or comp…
Bidirectional Text Compression in External Memory
Patrick Dinklage, Jonas Ellert, Johannes Fischer +2
Bidirectional compression algorithms work by substituting repeated substrings by references that, unlike in the famous LZ77-scheme, can point to either direction. We present such a…
Compression with the tudocomp Framework
Patrick Dinklage, Johannes Fischer, Dominik Köppl +2
We present a framework facilitating the implementation and comparison of text compression algorithms. We evaluate its features by a case study on two novel compression algorithms b…