| 1 | Postscript: Where to go next 2010-02-01 |
Play |
| 2 | Lecture 30: Maximum Parsimony and minimum mutation methods 2010-01-31 |
Play |
| 3 | Lecture 29; Additive trees and the Neighbor-Joining algorithm 2010-01-30 |
Play |
| 4 | Lecture 28: Algorithms for Ultrametric trees — molecular clocks 2010-01-29 |
Play |
| 5 | Lecture 27: Introduction to evolutionary trees - Ultrametric trees 2010-01-28 |
Play |
| 6 | Lecture 26: Hidden Markov models - The Backwards algorithm 2010-01-27 |
Play |
| 7 | Lecture 25: From the Vitterbi algorithm to the forward algorithm 2010-01-26 |
Play |
| 8 | Lecture 24: Hidden Markov models and the Vitterbi algorithm 2010-01-25 |
Play |
| 9 | Lecture 23: Hidden Markov models 2010-01-24 |
Play |
| 10 | Lecture 22: From profiles to Markov models 2010-01-23 |
Play |
