Reducing facet nucleation during algorithmic self-assembly

被引:48
作者
Chen, Ho-Lin
Schulman, Rebecca
Goel, Ashish
Winfree, Erik [1 ]
机构
[1] CALTECH, Dept Computat & Neural Syst, Pasadena, CA 91125 USA
[2] CALTECH, Dept Comp Sci, Pasadena, CA 91125 USA
[3] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
[4] Stanford Univ, Dept Management Sci & Engn, Stanford, CA 94305 USA
关键词
DNA; COMPUTATION;
D O I
10.1021/nl070793o
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
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.
引用
收藏
页码:2913 / 2919
页数:7
相关论文
共 29 条
  • [1] MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS
    ADLEMAN, LM
    [J]. SCIENCE, 1994, 266 (5187) : 1021 - 1024
  • [2] ADLEMAN LM, 2001, S THEOR COMP STOC
  • [3] Complexities for generalized models of self-assembly
    Aggarwal, G
    Cheng, Q
    Goldwasser, MH
    Kao, MY
    De Espanes, PM
    Schweller, RT
    [J]. SIAM JOURNAL ON COMPUTING, 2005, 34 (06) : 1493 - 1515
  • [4] Two computational primitives for algorithmic self-assembly: Copying and counting
    Barish, RD
    Rothemund, PWK
    Winfree, E
    [J]. NANO LETTERS, 2005, 5 (12) : 2586 - 2592
  • [5] BARYSHNIKOV YM, 2006, DNA COMPUTING
  • [6] Bloomfield V.A., 2000, University Science Books: Sausalito
  • [7] CHEN HL, 2005, DNA COMPUTING
  • [8] Building programmable jigsaw puzzles with RNA
    Chworos, A
    Severcan, I
    Koyfman, AY
    Weinkam, P
    Oroudjev, E
    Hansma, HG
    Jaeger, L
    [J]. SCIENCE, 2004, 306 (5704) : 2068 - 2072
  • [9] COOK M, 2004, DNCA COMPUTING
  • [10] Davey R., 2000, MOL CRYSTALLIZERS