19 citations · 65 across the 15 of their papers we have counts for
4 papers · 1 filter
Dismantling DivSufSort
Johannes Fischer, Florian Kurpicz
We give the first concise description of the fastest known suffix sorting algorithm in main memory, the DivSufSort by Yuta Mori. We then present an extension that also computes the…
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
Johannes Fischer, Dominik Köppl
We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representati…
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
Johannes Fischer, Florian Kurpicz, Marvin Löbel
The wavelet tree (Grossi et al. [SODA, 2003]) and wavelet matrix (Claude et al. [Inf. Syst., 47:15--32, 2015]) are compact indices for texts over an alphabet that support r…
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…