Phylogenetic Networks
| Title | Phylogenetic Networks, SoSe 2013 |
| Lectures | Prof. Daniel Huson and Dr. Cuong Van Than |
| Venue | Thursdays, 8:30-10:00, Sand 6/7, Hörsaal |
| Tutorials | Fridays, 8:15-10:00, Sand 14, C311 |
| Module | MSc Bioinformatik: Wahlpflichtmodul Bioinformatik oder Informatik; MSc Informatik: Wahlpflichtmodul Informatik 4 LP |
| Grading | Mid-term exam (40 %), final exam (40 %), exercises (20 %) |
| Bibliography | Huson, Rupp und Scornavacca, Phylogenetiv Networks, Cambridge University Press, 2010 |
| Language | English |
Contents
Although many biologists believe that reticulate events such as hybridization, horizontal gene transfer, recombination and reassortment play an important role in evolution, most published studies use trees to represent the evolutionary history for the set of species studied. One reason for this is the lack of robust and accepted methods for inferring non-tree histories or phylogenetic networks. A lot of work has been done in recent years to address this problem. This courses gives an introduction to some of the fundamental concepts and algorithms in phylogenetic networks.
| Date | Topic | Assignment |
|---|---|---|
| 18.4 | 1. Introduction and overview | Assignment01 |
| 25.4 | 2. Graphs and trees | Assignment02 |
| 2.5 | 3. Splits, clusters and compatibility | Assignment03 |
| 16.5 | 4. Splits and unrooted networks | Assignment04 |
| 6.6 | 5. Consensus trees and networks | |
| 13.6 | 6. Planar split networks and neighbor-net | Assignment06 |
| 20.6 | Mid-term exam | |
| 27.6 | 7. Clusters and rooted phylogenetic networks | Assignment07 |
| 4.7 | 8. Minimum hybridization networks | |
| 11.7 | 9. Drawing networks | Assignment09 |
| 18.7 | 10. Buneman graph | Assignment10 |
| 25.7 | Final exam |