Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the Decidability of Self-Assembly of Infinite Ribbons
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Error free self-assembly using error prone tiles
DNA'04 Proceedings of the 10th international conference on DNA computing
Compact error-resilient computational DNA tiling assemblies
DNA'04 Proceedings of the 10th international conference on DNA computing
On the complexity of graph self-assembly in accretive systems
Natural Computing: an international journal
Combining self-healing and proofreading in self-assembly
Natural Computing: an international journal
Healing DNA Self-Assemblies Using Punctures
Journal of Electronic Testing: Theory and Applications
Error suppression mechanisms for DNA tile self-assembly and their simulation
Natural Computing: an international journal
Polyomino-safe DNA self-assembly via block replacement
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
Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Programmable Control of Nucleation for Algorithmic Self-Assembly
SIAM Journal on Computing
Polyominoes simulating arbitrary-neighborhood zippers and tilings
Theoretical Computer Science
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
DNA'06 Proceedings of the 12th international conference on DNA Computing
Hi-index | 0.00 |
Algorithmic self-assembly has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanodevices. Whereas much previous work has investigated self-assembly programs using an abstract model of irreversible, errorless assembly, experimental studies as well as more sophisticated reversible kinetic models indicate that algorithmic self-assembly is subject to several kinds of errors. Previously, it was shown that proofreading tile sets can reduce the occurrence of mismatch and facet errors. Here, we introduce the zig-zag tile set, which can reduce the occurrence of spurious nucleation errors. The zig-zag tile set takes advantage of the fact that assemblies must reach a critical size before their growth becomes favorable. By using a zig-zag tile set of greater width, we can increase the critical size of spurious assemblies without increasing the critical size of correctly seeded assemblies, exponentially reducing the spurious nucleation rate. In combination with proofreading results, this result indicates that algorithmic self-assembly can be performed with low error rates without a significant reduction in assembly speed. Furthermore, our zig-zag boundaries suggest methods for exquisite detection of DNA strands and for the replication of inheritable information without the use of enzymes.