Joint Penn-UDel Colloquium on the Nature of Computing


Algorithmic Self-Assembly of DNA

Erik Winfree

Princeton University and Cal Tech




Fig. 1. Top: Tiles made of DNA. Bottom: Tiling Problem.



Biology makes things far smaller and more complex than anything produced by human engineering. The biotechnology revolution has for the first time given us the tools necessary to consider engineering on the molecular level. Research in DNA computation, launched by Len Adleman, has opened the door for experimental study of programmable biochemical reactions. This talk will focus on a single biochemical mechanism, the self-assembly of DNA structures, that is theoretically sufficient for Turing-universal computation. The theory combines Hao Wang's purely mathematical Tiling Problem with the branched DNA constructions of Nadrian Seeman. I will introduce branched DNA structures, illustrate the connection to the Tiling Problem, discuss biophysical issues that will determine error rates in any real system, and finally show experimental results confirming the self-assembly of a two-dimensional lattice of DNA Wang tiles. This system represents a first step toward the ability to program molecular reactions and molecular structures.


Friday, February 19, at 4 pm in Room 207 of the Johnson Pavilion (see map) near Spruce and 36th Streets on the University of Pennsylvania campus. Travel Directions are found at http://www.upenn.edu/fm/map/dir.html

The Joint Penn-UDel Colloquium on the Nature of Computing meets on each month's third Friday. To receive future announcements, or make suggestions, send email to wood@cis.udel.edu or check our Joint Colloquium home page, http://www.cis.udel.edu/~wood/DNA/colloquium
Prior colloquium
Next colloquium
Home Page of Joint Colloquium

Erik Winfree: Algorithmic Self-Assembly of DNA
Compiled by / wood@cis.udel.edu / Last revised February 11, 1999