午夜探花

See also

• Thomas B眉chler. Pangenome Structures: Design, Construction, and Applications. Dissertation 2025,
• Jannik Olbrich; Thomas B眉chler; Enno Ohlebusch. Generating Multiple Alignments on a Pangenomic Scale. Journal: Bioinformatics 2025,
• Jannik Olbrich; Thomas B眉chler; Enno Ohlebusch. Generating Multiple Alignments of Genomes of the Same Species. Conference: BIOINFORMATICS 2025,  https://doi.org/10.5220/0013165400003911
• Enno Ohlebusch; Thomas B眉chler; Jannik Olbrich. Faster computation of Chinese frequent strings and their net frequencies. Conference: SPIRE 2024,
• Thomas B眉chler; Jannik Olbrich; Enno Ohlebusch. Efficient short read mapping to a pangenome that is represented by a graph of ED strings. Journal: Bioinformatics 2023,
• Uwe Baier; Thomas B眉chler; Enno Ohlebusch; Pascal Weber. Edge Minimization in de Bruijn Graphs. Information and Computation 2022,
• Thomas B眉chler; Caroline R盲ther, Pascal Weber; Enno Ohlebusch. Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers. Conference: BIOINFORMATICS 2021 :  (Award: Best Student Paper)
• Uwe Baier; Thomas B眉chler; Enno Ohlebusch; Pascal Weber. Edge Minimization in de Bruijn Graphs. Data Compression Conference 2020,
• Thomas B眉chler; Enno Ohlebusch. An improved encoding of genetic variation in a Burrows-Wheeler transform. Journal: Bioinformatics 2019 ,
• Technical Report: Thomas B眉chler. Transforming a bidirected sequence graph into an EDS Graph, to enable the usage of the HPRC reference in the software GED-MAP. (2023)

• Kompletxit盲tstheorie (Exercises) [SS-24]
• Algorithmik: Thema Optimierung (Seminar) [SS-24]
• Grundlagen der Theoretischen Informatik (Exercises) [WS-23/24]
• Algorithmen (Seminar) [SS-23]
• Algorithmen und Datenstrukturen (Exercises) [WS-22/23]
• Algorithmn Engeneering: Thema Pan-Genom-Read-Mapping (Project) [SS-22]
• Algorithmen und Datenstrukturen (Exercises) [WS-21/22]
• Berechenbarkeit und Komplexit盲t (Exercises) [SS-21]
• Logik (Exercises) [SS-21]