User Tools

Site Tools


Algorithms in Comparative Genomics (2V + 2Ü)

392189/92 Dörr Winter 2018 TBD


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 breakpoint distance, followed by other simple measures such as SC/J and DCJ. The reversal distance will be discussed, and a general genome rearrangement distance, the so-called Hannenhalli-Pevzner 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 English.

Conditions for participation, prior knowledge

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



Back to Teaching

teaching/2018winter/cg.txt · Last modified: 2018/08/22 13:54 by Jens Stoye