A Method of Error Suppression for Self-assembling DNA Tiles

Self-assembling DNA tile is an important method of molecular computation. In this method, DNA tiles self-assemble a large two-dimensional lattice by the specific hybridization between complementary strands. Hence hybridization is not a deterministic, but stochastic, process which depends on tile concentration and temperature. For that reason, it is difficult to obtain an aggregate with no error. Growth speed of the aggregate must be very low to obtain an aggregate that contains less errors. Winfree et al. proposed the Proofreading Tile Model (PTM), which achieves both a low error rate and fast growth speed by splitting tiles into pieces to enhance tile specificity. However, it remains difficult to implement because it requires a large set of completely orthogonal strands. This paper presents a novel method called Layered Tile Model (LTM) to realize the reliable self-assembly of DNA tiles. We introduce layered tiles which are covered by other tiles called protective tiles. Those protective tiles verify the correctness of connections of the former tiles. Simulation and analysis are used to evaluate LTM performance. Results demonstrate that LTM offers similar performance compared to 2 x 2 PTM. It also has unique properties that are considered to be practical for implementation.

[1]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[2]  Hao Yan,et al.  Parallel Molecular Computations of pair-wise XOR using DNA “String Tile” Self- Assembly , 2003 .

[3]  Hao Wang.  Dominoes and the Aea Case of the Decision Problem , 1990 .

[4]  Erik Winfree,et al.  Universal computation via self-assembly of DNA: Some theory and experiments , 1996, DNA Based Computers.

[5]  Erik Winfree,et al.  Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly , 2003, DNA.

[6]  E. Winfree.  Simulations of Computing by Self-Assembly , 1998 .

[7]  J. Reif,et al.  Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[8]  A. Turberfield,et al.  DNA fuel for free-running nanomachines. , 2003, Physical review letters.

[9]  Alessandra Carbone,et al.  Circuits and programmable self-assembling DNA structures , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Hao Wang.  Proving theorems by pattern recognition — II , 1961 .

[11]  P. Hsieh,et al.  The kinetics of spontaneous DNA branch migration. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[12]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[13]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[14]  N. Seeman,et al.  DNA double-crossover molecules. , 1993, Biochemistry.

[15]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[16]  P. Hsieh,et al.  Branch migration through DNA sequence heterology. , 1998, Journal of molecular biology.

[17]  Ming-Yang Kao,et al.  DNA Self-Assembly For Constructing 3D Boxes , 2001, ISAAC.