
HOLZ: HighOrder Entropy Encoding of LempelZiv Factor Distances
We propose a new representation of the offsets of the LempelZiv (LZ) fa...
read it

FMIndexing Grammars Induced by Suffix Sorting for Long Patterns
The runlength compressed BurrowsWheeler transform (RLBWT) used in conj...
read it

SpaceEfficient Huffman Codes Revisited
Canonical Huffman code is an optimal prefixfree compression code whose ...
read it

On Arithmetically Progressed Suffix Arrays and related BurrowsWheeler Transforms
We characterize those strings whose suffix arrays are based on arithmeti...
read it

Grammar Index By Induced Suffix Sorting
Pattern matching is the most central task for text indices. Most recent ...
read it

LoadBalancing Succinct B Trees
We propose a B tree representation storing n keys, each of k bits, in ei...
read it

PHONI: Streamed Matching Statistics with MultiGenome References
Computing the matching statistics of patterns with respect to a text is ...
read it

InPlace Bijective BurrowsWheeler Transforms
One of the most wellknown variants of the BurrowsWheeler transform (BW...
read it

Grammarcompressed Selfindex with Lyndon Words
We introduce a new class of straightline programs (SLPs), named the Lyn...
read it

Constructing the Bijective BWT
The BurrowsWheeler transform (BWT) is a permutation whose applications ...
read it

RePair InPlace
RePair is a grammar compression scheme with favorably good compression ...
read it

Bidirectional Text Compression in External Memory
Bidirectional compression algorithms work by substituting repeated subst...
read it

Dynamic PathDecomposed Tries
A keyword dictionary is an associative array whose keys are strings. Rec...
read it

Compact Data Structures for Shortest Unique Substring Queries
Given a string T of length n, a substring u = T[i.. j] of T is called a ...
read it

Separate Chaining Meets Compact Hashing
While separate chaining is a common strategy for resolving collisions in...
read it

Dynamic Packed Compact Tries Revisited
Given a dynamic set K of k strings of total length n whose characters ar...
read it
Dominik Köppl
is this you? claim profile