6.096 Algorithms for Computational Biology (U)

F9:30-11, Room 32-123
Professor Manolis Kellis, manoli@mit.edu
Prereq.: 6.001, 7.01
2-0-4

Fall 2004 Catalogue Supplement 6.096 Algorithms for Computational Biology (U) F9:30-11, Room 32-123 Professor Manolis Kellis, manoli@mit.edu Prereq.: 6.001, 7.01 2-0-4

This new course covers the algorithmic foundations of computational biology, combining theory with practice. We study the principles of algorithm design for biological datasets, analyze influential algorithms, and apply these to real datasets. Topics include:

Strings: biological sequence analysis, gene finding, motif discovery, RNA folding, global and local sequence alignment

Genomes: genome assembly, comparative genomics, genome duplication, genome rearrangements, evolutionary theory

Networks: gene expression, clustering algorithms, scale-free networks, machine learning applications to genomics

Lectures and homeworks are coordinated with 6.046 (MW9:30-11), the quintessential introductory algorithms course taught by Charles Leiserson and Ron Rivest.

How to enroll: With 6.046: The best of both worlds! Enroll simultaneously in 6.046 and 6.096. 6.046 meets on MW 930-11. Grading is separate in the two courses.

After 6.046: If you're already taken algorithms, you can enroll for 6.096 only, as a separate course, with permission of instructors.

Enrollment may be limited.