Bachelor and Master Thesis Topics within the AG Genome Informatics


The following is a (probably incomplete) list of thesis topics offered within the Genome Informatics group. If you are interested in working on one of these (or anything else in Genome Informatics), please contact the responsible group members or see Prof. Jens Stoye.

Improvement of Sequence-to-Graph Alignment (Bachelor)

Tizian Schulz (Please also refer to the project page: PLAST)

PLAST is a new heuristic method to find maximum scoring local alignments of a DNA query sequence to a pangenome represented as a compacted colored de Bruijn graph. The first method has been published here, but there exist various ideas how to improve the method. Some are well suited for a Bachelor thesis. Contact Tizian for details.

(Runtime) Heuristic for the Fast Comparison of Genomes (Bachelor)

Leonard Bohnenkämper (Also refer to the gitlab1/ 2)

DING (publication) is an exact ILP solution for an NP-hard problem, comparing arbitrary genomes on a high level under the DCJ-Indel model. It is already very fast for small to medium size genomes. However, for some large or very complex genomes that occur in practice, DING is not able to calculate solutions. There are some ideas how to circumvent this problem using approximate or heuristic methods, which could be developed as a Bachelor thesis or as a Master project module. Contact Leonard for details.

DCJ-Indels of Natural Genes (Bachelor)

Jens Stoye

We have developed the tool DING (DCJ-Indels of Natural Genomes), which could also be applied to protein sequences, resulting in a new tool DING (DCJ-Indels of Natural Genes).

Necessary is basic knowledge in algorithms and sequence analysis, ideally also algorithms in comparative genomics.