Algorithmic Self-Assembly: Models and Problems

Wednesday, September 7, 2005 - 11:00am
Skiles 255
Ashish Goel
Stanford University

DNA Self-assembly has emerged as an important technique for molecular computation and nano-technology. At these scales, self- assembly is governed by simple (and local) probabilistic rules for growth, making it amenable to algorithmic techniques. We will discuss two important challenges in algorithmic self-assembly: robustness and efficiency. This talk will present recent results, and also attempt to provide a road-map of open problems.