Computation for biological engineers
Bachelor's degree
In Maynard (USA)
Description
-
Type
Bachelor's degree
-
Location
Maynard (USA)
-
Start date
Different dates available
This course covers the analytical, graphical, and numerical methods supporting the analysis and design of integrated biological systems. Topics include modularity and abstraction in biological systems, mathematical encoding of detailed physical problems, numerical methods for solving the dynamics of continuous and discrete chemical systems, statistics and probability in dynamic systems, applied local and global optimization, simple feedback and control analysis, statistics and probability in pattern recognition.
Facilities
Location
Start date
Start date
Reviews
Subjects
- Probability
- Systems
- Design
- Statistics
Course programme
Lectures: 2 sessions / week, 1 hour / session
20.180
There will be short assignments distributed at almost every lecture. We expect that all assignments will be turned in by midnight on the day they are due. You may discuss assignments with your classmates but we expect that you will submit your own work. Late assignments (up to one week late) will be given 1/2 credit; solutions for assignments will be posted at the posted due date. A family crisis or severe illness requiring attention from the infirmary and prohibiting you from all your coursework are acceptable reasons for missing an exam; every effort will be made to accommodate you in these exceptional circumstances. More information regarding academic integrity is available here.
The course is divided into three modules, with exams at the end of each module.
Module 1: Phylogenetic Inference (Lec #1-8)
Module 2: Molecular Modeling / Protein Design (Lec #10-17)
Module 3: Discrete Reaction Event Network Modeling (Lec #19-24)
Each module covers the following general topics:
Course Overview
Introduction to Phylogenetic Inference; Case Studies; Phylogenetic Trees; Quick Review of Recursion
Phylogenetic Trees: Overview, Possible Trees
Python®: Trees; Data Structure, Parsing Function
Greedy Algorithm for Trying Trees
Review
Don't show me this again
This is one of over 2,200 courses on OCW. Find materials for this course in the pages linked along the left.
MIT OpenCourseWare is a free & open publication of material from thousands of MIT courses, covering the entire MIT curriculum.
No enrollment or registration. Freely browse and use OCW materials at your own pace. There's no signup, and no start or end dates.
Knowledge is your reward. Use OCW to guide your own life-long learning, or to teach others. We don't offer credit or certification for using OCW.
Made for sharing. Download files for later. Send to friends and colleagues. Modify, remix, and reuse (just remember to cite OCW as the source.)
Learn more at Get Started with MIT OpenCourseWare
Computation for biological engineers