The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
DNA Self-Assembly For Constructing 3D Boxes
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the complexity of graph self-assembly in accretive systems
Natural Computing: an international journal
Error suppression mechanisms for DNA tile self-assembly and their simulation
Natural Computing: an international journal
Activatable tiles: compact, robust programmable assembly and other applications
DNA13'07 Proceedings of the 13th international conference on DNA computing
Combining randomness and a high-capacity DNA memory
DNA13'07 Proceedings of the 13th international conference on DNA computing
Self-correcting self-assembly: growth models and the hammersley process
DNA'05 Proceedings of the 11th international conference on DNA Computing
Complexity of graph self-assembly in accretive systems and self-destructible systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
A self-assembly model of time-dependent glue strength
DNA'05 Proceedings of the 11th international conference on DNA Computing
On the complexity of graph self-assembly in accretive systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
| Hi-index | 0.00 |
Self-assembling DNA tile is an important method of molecular computation. In this method, DNA tiles self-assemble a large twodimensional lattice by the speci.c 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 di.cult 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 speci.city. However, it remains di.cult 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 o.ers similar performance compared to 2 × 2 PTM. It also has unique properties that are considered to be practical for implementation.