Reducing facet nucleation during algorithmic self-assembly.

Nano Lett

Department of Computer Science, Stanford University, Stanford, California 94305, USA.

Published: September 2007

Algorithmic self-assembly, a generalization of crystal growth, has been proposed as a mechanism for bottom-up fabrication of complex nanostructures and autonomous DNA computation. In principle, growth can be programmed by designing a set of molecular tiles with binding interactions that enforce assembly rules. In practice, however, errors during assembly cause undesired products, drastically reducing yields. Here we provide experimental evidence that assembly can be made more robust to errors by adding redundant tiles that "proofread" assembly. We construct DNA tile sets for two methods, uniform and snaked proofreading. While both tile sets are predicted to reduce errors during growth, the snaked proofreading tile set is also designed to reduce nucleation errors on crystal facets. Using atomic force microscopy to image growth of proofreading tiles on ribbon-like crystals presenting long facets, we show that under the physical conditions we studied the rate of facet nucleation is 4-fold smaller for snaked proofreading tile sets than for uniform proofreading tile sets.

Download full-text PDF

Source
http://dx.doi.org/10.1021/nl070793oDOI Listing

Publication Analysis

Top Keywords

tile sets
16
proofreading tile
16
snaked proofreading
12
facet nucleation
8
algorithmic self-assembly
8
tile
5
proofreading
5
reducing facet
4
nucleation algorithmic
4
self-assembly algorithmic
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!