In 1994 Adleman demonstrated the first DNA computation when he solved a version of the Traveling Salesman Problem (finding the cheapest way to visit a set of cities without any backtracking.) See Adleman's Scientific American article about this in the August 1998 issue. The main part of this course is organized around recent additional DNA computing approaches to TSP. An overview of additional problems and techniques rounds out the course.
Each student makes one or two presentations summarizing and comparing
published results.
Two term papers are required, and two mid-term exams plus a final.
The course does not involve any laboratory work.