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.
| Topic | Assignments | Date |
|---|
| 1. Graphs (lec1.pdf) | hw1.pdf | 10/04/2014 |
| 2. Phylogenetic trees (lec2.pdf) | hw2.pdf | 17/04/2014 |
| 3.Splits and unrooted networks (lec3.pdf) | hw3.pdf | 24/04/2014 |
| 4. Splits and unrooted networks (continued) | | |
| 5. Consensus trees and networks | | |
| 6. Planar split networks and neighbor-net | | |
| Mid-term exam | | |
| 7. Clusters and rooted phylogenetic networks | | |
| 8. Minimum hybridization networks | | |
| 9. Drawing networks | | |
| 10. Buneman graph | | |
| Final exam | | |
