Invadable self-assembly: combining robustness with efficiency

zbMATH Open1318.68082MaRDI QIDQ5501351FDOQ5501351

Ashish Goel, Ho-Lin Chen, Pablo Moisset de Espanés, Ming-Deh A. Huang, Qi Cheng

Publication date: 3 August 2015

Recommendations

• DNA Computing
• Algorithmic DNA Self-assembly
• DNA Computing
• Toward minimum size self-assembled counters
• Toward Minimum Size Self-Assembled Counters

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (14)

• Self-correcting Self-assembly: Growth Models and the Hammersley Process
• Complexity of graph self-assembly in accretive systems and self-destructible systems
• Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
• Polyomino-safe DNA self-assembly via block replacement
• Error suppression mechanisms for DNA tile self-assembly and their simulation
• A Brief Tour of Theoretical Tile Self-Assembly
• Capabilities and limits of compact error resilience methods for algorithmic self-assembly
• DNA Computing
• A Self-assembly Model of Time-Dependent Glue Strength
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• Polyomino-Safe DNA Self-assembly via Block Replacement
• On the complexity of graph self-assembly in accretive systems
• Activatable tiles for compact robust programmable molecular assembly and other applications
• Toward minimum size self-assembled counters

This page was built for publication: Invadable self-assembly: combining robustness with efficiency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501351)