6.096 | Spring 2005 | Undergraduate

Algorithms for Computational Biology

Lecture Notes

lectures7and8.pdf

Description:

This file explains computational model (simple Markov models, hidden Markov models), working with HMMs (dynamic programming (Viterbi), expectation maximization (Baum-Welch)), and gene finding in practice (GENSCAN, performance evaluation).

Resource Type:
Lecture Notes

Course Info

As Taught In
Spring 2005
Learning Resource Types
Lecture Notes
Programming Assignments
Problem Sets