Algorithms in Comparative Genomics (2V + 2Ü)

392190 Braga, Stoye Fr 08:30 - 10:00 (Ü) in U10-146
392191 Braga, Stoye Fr 10:15 - 11:45 (V) in U10-146

Content

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. 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

Literature

Preliminary version of the lecture notes:

Chapter 1

Chapter 2

Other references are listed below, together with the schedule.

Topics

  1. Distance and Sorting
    • Breakpoint model
    • Single-Cut-or-Join (SCJ) model
    • Double-Cut-and-Join (DCJ) model
    • DCJ-indel model
    • Inversion model
  2. Ancestral Reconstruction
    • Median and halving
    • SCJ Small Parsimony
  3. Conserved Gene Clusters
    • Generators for common intervals
    • Strong common intervals and PQ-trees
    • Common intervals of strings

Schedule

Date Topic Literature Exercises
11.04.2025 (M)
18.04.2025 (-) (Good Friday)
25.04.2025 (M)
02.05.2025
09.05.2025 (M)
16.05.2025
23.05.2025
30.05.2025
06.06.2025 (M)
13.06.2025
20.06.2025
27.06.2025 (M)
04.07.2025
11.07.2025
18.07.2025