M.Sc. Thomas Büchler

• Algorithmen und Komplexität
• Sequenzanalyse: Pangenome, Alignment, Pattern Matching

Pan-Genome Structures: Desing, Construction, and Applications

Siehe auch Orc

• Thomas Büchler. Pangenome Structures: Design, Construction, and Applications. Dissertation (Submitted)

• Jannik Olbrich; Thomas Büchler; Enno Ohlebusch. Generating Multiple Alignments on a Pangenomic Scale (Submitted)

• Enno Ohlebusch; Thomas Büchler; Jannik Olbrich. Faster computation of Chinese frequent strings and their net frequencies. Conference: SPIRE 2024, https://doi.org/10.1007/978-3-031-72200-4_19

• 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, https://doi.org/10.1093/bioinformatics/btad320

• Uwe Baier; Thomas Büchler; Enno Ohlebusch; Pascal Weber. Edge Minimization in de Bruijn Graphs. Information and Computation 2022, doi.org/10.1016/j.ic.2021.104795

• 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 :  doi.org/10.5220/0010165400210029 (Award: Best Student Paper)

• Uwe Baier; Thomas Büchler; Enno Ohlebusch; Pascal Weber. Edge Minimization in de Bruijn Graphs. Data Compression Conference 2020, doi.org/10.1109/DCC47342.2020.00030

• Thomas Büchler; Enno Ohlebusch. An improved encoding of genetic variation in a Burrows-Wheeler transform. Journal: Bioinformatics 2019 , https://doi.org/10.1093/bioinformatics/btz782
• 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 (Übung) [SS-24]
• Algorithmik: Thema Optimierung (Seminar) [SS-24]
• Grundlagen der Theoretischen Informatik (Übung) [WS-23/24]
• Algorithmen (Proseminar) [SS-23]
• Algorithmen und Datenstrukturen (Übung) [WS-22/23]
• Algorithmn Engeneering: Thema Pan-Genom-Read-Mapping (Projekt) [SS-22]
• Algorithmen und Datenstrukturen (Übung) [WS-21/22]
• Berechenbarkeit und Komplexität (Übung) [SS-21]
• Logik (Übung) [SS-21]