392189 Algorithms in Comparative Genomics (V) (SoSe 2018)

Many questions in molecular biology, phylogenetics, and biomedicine can be approached through comparison of two or more genomes. However, a global alignment of multiple large genomes is often infeasible or comes at great expense. It is more efficient to compare genomes on a higher level of abstraction, as given by the succession of single-copy genes or other kinds of unique genomic markers on the chromosomal sequences.

In this course, various models of higher level genome comparison are discussed. We start with the classical reversal distances which are measures to study chromosomal sequences only permuted by inversions. We then continue by discussing distances such as SC/J or DCJ, and a general rearrangement distance. It then follows a discussion of methods that solve the problem of comparing sequences with unequal gene/marker content. We will also study methods for the reconstruction of ancestral genomes.

Algorithms discussed in this course are mostly combinatorial by nature, similar to the sequence analysis course.

This course is taught in German or English if needed.

Teilnahmevoraussetzungen, notwendige Vorkenntnisse

Required: Algorithms and Data Structures (or comparable)
Recommended: Sequence Analysis and Foundations of Genome Research

Externe Kommentarseite

https://gi.cebitec.uni-bielefeld.de/teaching/2018summer/cg