1 citations · 1 across the 3 of their papers we have counts for
3 papers
q-bio.GN2025
The TAG array of a multiple sequence alignment
Jannik Olbrich, Enno Ohlebusch
Modern genomic analyses increasingly rely on pangenomes, that is, representations of the genome of entire populations. The simplest representation of a pangenome is a set of indivi…
cs.DS2025
Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
Jannik Olbrich
The Burrows-Wheeler Transform (BWT) serves as the basis for many important sequence indexes. On very large datasets (e.g. genomic databases), classical BWT construction algorithms…
cs.DS2022★ 1 cited
On the Optimisation of the GSACA Suffix Array Construction Algorithm
Jannik Olbrich, Enno Ohlebusch, Thomas Büchler
The suffix array is arguably one of the most important data structures in sequence analysis and consequently there is a multitude of suffix sorting algorithms. However, to this dat…