Algorithms in Bioinformatics

BIOINF3310 Phylogeny and Evolution

Lecturers Prof. Daniel Huson, Xi Chen and Timo Lucas
Lectures

Tuesdays, 8:15-10, in F122 Hörsaal, Sand 6/7

Assignments

Assignments will be made available every Tuesday at 8am via Ilias. Solutions are due by the following Tuesday  at 8am. 

Tutorials

Group A, Wednesdays, 16-18h, C215, Sand 14

Group B, Wednesdays, 16-18h, F122, Sand 6/7

Weekly tutorials will take place starting in the second week. Participation is mandatory.

Exam Written exam
Audience Bachelor and master students, bioinformatics, 6 LP
Language English
Links Alma Ilias     Script

Contents

This course gives an introduction to the basic concepts and methods of phylogenetics. 

Weekly assignments are handed out in class.

Date Topic Assignments
19.04. 1. Graphs and trees Assignment 1
26.04. 2. Counting trees and distances between trees Assignment 2
03.05. 3. Maximum parsimony methods Assignment 3
10.05. continued Assignment 4
17.05. 4. Distance-based methods Assignment 5
24.05. 5. Sequence-based methods Assignment 6
31.05. 6. Rooted trees and networks Assignment 7
14.06. continued Assignment 8
21.06. 7. Unrooted trees and networks Assignment 9
28.06. continued Assignment 10
05.07. 8. Consensus trees and networks Assignment 11
12.07. 9. Neighbor net Assignment 12
19.07. 10. Phylogenetic outlines Practice exam
26.07. Exam  
     
     

There will be a makeup exam on September 28, 14:15-15:45, LocationF119, Sand 6/7. Please send an email to Prof. Daniel Huson if you intend to participate in this exam.

Recommended textbooks

How to get credit for this course

  • Always participate in the weekly problem sessions and actively present your results. If you miss more than two tutorials, then you will not be allowed to take the exam.
  • Assignments are set weekly and are due the following week.
  • Obtain at least 50% of all points. If you obtain 70%, 80% or 90% of all possible assignment points, then you will receive bonus points toward your exam.
  • Pass the exam.