107 citations · 409 across the 18 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 14 cited
Optimal Construction of Compressed Indexes for Highly Repetitive Texts
Dominik Kempa
We propose algorithms that, given the input string of length over integer alphabet of size , construct the Burrows-Wheeler transform (BWT), the permuted longest-common-prefi…
cs.DS2017★ 107 cited
At the Roots of Dictionary Compression: String Attractors
Dominik Kempa, Nicola Prezza
A well-known fact in the field of lossless text compression is that high-order entropy is a weak model when the input contains long repetitions. Motivated by this, decades of resea…