Genome-scale algorithmics

We develop algorithms and data structures for the analysis of genome-scale data. Such data is abundant due to modern molecular biology measurement techniques like high-throughput sequencing. We are especially interested in applications of compressed data structures, that make it possible to analyse the often highly redundant data within the space of their information content.


Looking for a Master's thesis topic? We can offer a funded position on a topic related to the project "Sequence analysis revisited and extended". The topic is about extending algorithms for computing maximal exact matches between two sequences to the case where one of the input is a directed acyclic graph. This extension is required for creating the input for our new extension of co-linear chaining (to appear in RECOMB 2018).