Jannik Olbrich

Orcid: 0000-0003-3291-7342

According to our database1, Jannik Olbrich authored at least 9 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars.
CoRR, April, 2025

Finding Minimum Matching Cuts in <i>H</i>-free Graphs and Graphs of Bounded Radius and Diameter.
CoRR, February, 2025

Generating Multiple Alignments of Genomes of the Same Species.
Proceedings of the 18th International Joint Conference on Biomedical Engineering Systems and Technologies, 2025

2024
Generic Non-recursive Suffix Array Construction.
ACM Trans. Algorithms, April, 2024

Hardness Results on Characteristics for Elastic-Degenerated Strings.
CoRR, 2024

Faster Computation of Chinese Frequent Strings and Their Net Frequencies.
Proceedings of the String Processing and Information Retrieval, 2024

2023
Efficient short read mapping to a pangenome that is represented by a graph of ED strings.
Bioinform., May, 2023

2022
On the Optimisation of the GSACA Suffix Array Construction Algorithm.
Proceedings of the String Processing and Information Retrieval, 2022

2021
Property-Based Testing for Visualization Development.
Proceedings of the 2nd Workshop on the Gap between Visualization Research and Visualization Software, 2021


  Loading...