Course»Course 6»Fall 2007»6.047/6.878»Homepage

6.047/6.878  Computational Biology: Genomes, Networks, Evolution

Fall 2007

home page image

Computational Challenges in Biology

Instructors: Manolis Kellis, James E. Galagan

TAs: David Sontag, Mike Lin

Lecture:  TR11-12.30  (1-190)
Recitation:  F12  (4-231)      

Information: 

Covers the algorithmic and machine learning foundations of computational biology, combining theory with practice. We study principles of algorithm design, influential problems and techniques, and analyze large-scale biological datasets.


Topics include:
  • Genomes: sequence analysis, gene finding, RNA folding, genome alignment and assembly, database search;

  • Networks: gene expression analysis, regulatory motifs, biological network analysis;

  • Evolution: comparative genomics, phylogenetics, genome duplication, genome rearrangements, evolutionary theory.

These are coupled with fundamental algorithmic techniques including: dynamic programming, hashing, Gibbs sampling, Expectation Maximization, hidden Markov models, stochastic context-free grammars, graph clustering, dimensionality reduction, Bayesian networks.

Units: 3-0-9
Prerequisites: 6.001, 7.01, 6.041


Lecture slides and materials from previous years: Student evaluations from previous years (requires MIT certificates):

Announcements

Lecture will be held in 1-190 for the remainder of the semester

Announced on 18 September 2007  3:10  p.m. by Michael Lin

Scribe Policy

Details about this year's scribing requirement has been posted in the course materials. Please review it and e-mail 6047-staff@csail.mit.edu with your lecture preferences as soon as possible.


Please notify the course staff immediately if you have not been receiving e-mails from us.

Announced on 10 September 2007  12:03  a.m. by Michael Lin