Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 2007 | Supplemental Material
Journal Article Open

Reducing facet nucleation during algorithmic self-assembly

Abstract

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.

Additional Information

© 2007 American Chemical Society. Received April 4, 2007; Revised Manuscript Received July 3, 2007. Publication Date (Web): August 24, 2007. We thank Paul Rothemund and an anonymous referee for useful comments and discussions. E.W. acknowledges National Science Foundation (NSF) awards 0093486 and 0432193. E.W. and A.G. acknowledge NSF award 0523761. A.G. acknowledges NSF awards 0339262 and 0323766.

Attached Files

Supplemental Material - nl070793osi20070703_032522.pdf

Files

nl070793osi20070703_032522.pdf
Files (95.2 kB)
Name Size Download all
md5:c132cfbb7f6855d1eb12aaa9b820d180
95.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 23, 2023