Skip to content

Author

Lukas Nalbach

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Practical and Space-Efficient LZ77 and LZ Pre-Compression via String Synchronizing Sets

The Lempel-Ziv (LZ77) factorization decomposes a text into the least possible number $z$ of phrases that each refer to an earlier occurrence. It is this phrase count, rather than the encoded size, that governs the size of LZ-based compressed indexes, and computing a factorization with few phrases is a time and space bo...

J. Ellert, Lukas Nalbach · 0 citations
Preprint Sep 2026

Move-rb: Faster Bi-Directional r-indexes and Approximate Pattern Matching

Approximate pattern matching (APM) on highly repetitive texts is a central task in bioinformatics. Bi-directional r-indexes support left- and right-extension of a pattern and thereby accelerate APM algorithms based on search schemes, but existing variants -- br-index and b-move -- suffer from two bottlenecks: $O(\sigma...

Johannes Fischer, Lukas Nalbach · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.