dc.contributor.author | Khodor, Julia | |
dc.coverage.temporal | Spring 2005 | |
dc.date.accessioned | 2023-10-11T19:54:40Z | |
dc.date.available | 2023-10-11T19:54:40Z | |
dc.date.issued | 2005-06 | |
dc.identifier | 7.349-Spring2005 | |
dc.identifier.other | 7.349 | |
dc.identifier.other | IMSCP-MD5-1e9d3b9feca1df0ccc8ff8a166eb9464 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/152415 | |
dc.description.abstract | Imagine you are a salesman needing to visit 100 cities connected by a set of roads. Can you do it while stopping in each city only once? Even a supercomputer working at 1 trillion operations per second would take longer than the age of the universe to find a solution when considering each possibility in turn. In 1994, Leonard Adleman published a paper in which he described a solution, using the tools of molecular biology, for a smaller 7-city example of this problem. His paper generated enormous scientific and public interest, and kick-started the field of Biological Computing, the main subject of this discussion based seminar course. Students will analyze the Adleman paper, and the papers that preceded and followed it, with an eye for identifying the engineering and scientific aspects of each paper, emphasizing the interplay of these two approaches in the field of Biological Computing. This course is appropriate for both biology and non-biology majors. Care will be taken to fill in any knowledge gaps for both scientists and engineers.This course is one of many Advanced Undergraduate Seminars offered by the Biology Department at MIT. These seminars are tailored for students with an interest in using primary research literature to discuss and learn about current biological research in a highly interactive setting. | en |
dc.language.iso | en-US | |
dc.rights | This site (c) Massachusetts Institute of Technology 2023. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en |
dc.rights | Attribution-NonCommercial-ShareAlike 3.0 Unported | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | * |
dc.subject | biological computing | en |
dc.subject | Leonard Adleman | en |
dc.subject | exquisite detection | en |
dc.subject | whole-cell computing | en |
dc.subject | computation | en |
dc.subject | molecular biology | en |
dc.subject | biotin-avidin | en |
dc.subject | magnetic beads | en |
dc.subject | cellular processes | en |
dc.subject | combinatorial problems | en |
dc.subject | self-assembly | en |
dc.subject | nanodevices | en |
dc.subject | molecular machines | en |
dc.subject | quorum sensing | en |
dc.subject | molecular switches | en |
dc.subject | ciliates | en |
dc.subject | molecular gates | en |
dc.subject | molecular circuits | en |
dc.subject | genetic switch | en |
dc.subject | cellular networks | en |
dc.subject | genetic networks | en |
dc.subject | genetic circuits | en |
dc.title | 7.349 Biological Computing: At the Crossroads of Engineering and Science, Spring 2005 | en |
dc.title.alternative | Biological Computing: At the Crossroads of Engineering and Science | en |
dc.type | Learning Object | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Biology | |
dc.audience.educationlevel | Undergraduate | |
dc.subject.cip | 261308 | en |
dc.subject.cip | Systematic Biology/Biological Systematics | en |
dc.date.updated | 2023-10-11T19:54:48Z | |