An improved encoding of genetic variation in a Burrows-Wheeler transform. - Thomas Büchler; Enno Ohlebusch (Bioinform., 2020)

Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers. - Thomas Büchler; Caroline Räther; Pascal Weber 001; Enno Ohlebusch (BIOINFORMATICS, 2021)

On the Optimisation of the GSACA Suffix Array Construction Algorithm. - Jannik Olbrich; Enno Ohlebusch; Thomas Büchler (SPIRE, 2022)

Edge minimization in de Bruijn graphs. - Uwe Baier; Thomas Büchler; Enno Ohlebusch; Pascal Weber 001 (Inf. Comput., 2022)

Efficient short read mapping to a pangenome that is represented by a graph of ED strings. - Thomas Büchler; Jannik Olbrich; Enno Ohlebusch (Bioinform., 2023)

Faster Computation of Chinese Frequent Strings and Their Net Frequencies. - Enno Ohlebusch; Thomas Büchler; Jannik Olbrich (SPIRE, 2024)

Generic Non-recursive Suffix Array Construction. - Jannik Olbrich; Enno Ohlebusch; Thomas Büchler (ACM Trans. Algorithms, 2024)

Generating Multiple Alignments of Genomes of the Same Species. - Jannik Olbrich; Thomas Büchler; Enno Ohlebusch (BIOSTEC (1), 2025)