 |
 |
 |
 |
|
| Tutorial 1 | | Parameter Estimation by MLE |
tutorial01.ppt 266 KB
|
| Notes: | - Maximum Likelihood Estimation
- Posterior Probability Estimator
- Prior Distributions |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 2 | | Pairwise sequence alignment |
tutorial02.ppt 241 KB
|
| Notes: | - Overlap alignment
- Dealing with affine gap scores |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 3 | | More on Alignment |
tutorial03.ppt 206 KB
|
| Notes: | - The "breaking number" problem
- Multiple-sequence alignment
- Approximation algorithm for min-cost multiple-sequence alignment |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 4 | | Tree Alignments for Multiple Sequences |
tutorial04.ppt 228 KB
|
| Notes: | -Clustal agorithm and profile alignment
-Lifted Tree Alignment |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 6 | | Inference in HMMs |
tutorial06.ppt 427 KB
|
| Notes: | - Inference queries: likelihood, most-probable state, and most-probable path.
- Dynamic programming algorithms: forward / backward / viterbi |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 8 | | Baum-Welch Algorithm |
tutorial08.ppt 309 KB
|
| Notes: | - Parameter estimation for HMMs
- Supervised vs. unsupervised learning
- The EM approach - Baum-Welch algorithm |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 9 | | The EM algorithm for learning |
tutorial09.ppt 488 KB
|
| Notes: | - using EM to find genotype statistics on the ABO locus |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 10 | | Perfect Phylogeny |
tutorial10.ppt 437 KB
|
| Notes: | - Efficient algorithm for the directed binary perfect phylogeny problem |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 11 | | Parsimony |
tutorial11.ppt 289 KB
|
| Notes: | - Sankoff's algorithm for weighted parsimony
- Fitch's algorithm as a special case of Sankoff's algorithm |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Tutorial 12 | | Distance Based Phylogenetic Reconstruction |
tutorial12.ppt 259 KB
|
| Notes: | - The DLCA neighbor joining algorithm
- Atteson's robustness criteria
- Proof of robustness for DLCA |
|
 |
 |
 |
 |
 |