黑料传送门

• Jannik Olbrich
  Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
  European Symposium on Algorithms 2025
  DOI:
• Jannik Olbrich, Thomas B眉chler, Enno Ohlebusch
  Generating multiple alignments on a pangenomic scale
  Bioinformatics
  2025
  DOI:
• Jannik Olbrich, Thomas B眉chler, Enno Ohlebusch
  Generating multiple alignments of genomes of the same species
  Proceedings of the 18th International Joint Conference on Biomedical Engineering Systems and Technologies 2025
• Enno Ohlebusch, Thomas B眉chler, Jannik Olbrich
  Faster Computation of Chinese Frequent Strings and Their Net Frequencies
  String Processing and Information Retrieval 2024
  DOI:
• Jannik Olbrich, Enno Ohlebusch, Thomas B眉chler
  Generic Non-recursive Suffix Array Construction
  ACM Trans. Algorithms
  April 2024
  DOI:
• Thomas B眉chler, Jannik Olbrich, Enno Ohlebusch
  Efficient short read mapping to a pangenome that is represented by a graph of ED strings
  Bioinformatics
  May 2023
  DOI:
• Jannik Olbrich, Enno Ohlebusch, Thomas B眉chler
  On the Optimisation of the GSACA Suffix Array Construction Algorithm
  String Processing and Information Retrieval 2022
  DOI:
• Michael Stegmaier, Dominik Engel, Jannik Olbrich, Timo Ropinski, Matthias Tichy
  Property-Based Testing for Visualization Development
  The Gap between Visualization Research and Visualization Software (VisGap)
  April 2021
  DOI:

• Bronze Medal (Northwestern Europe Regional Contest 2019)
• Silver Medal (German Collegiate Programming Contest 2021)
• Jury member for the GCPC and Winter Contest since 2022
• Coach for the Ulm University International Collegiate Programming Contest (ICPC) team

If you are a student at Ulm University and want to try competitive programming feel free to contact me. For more information see