Resiliency to multiple nucleation in temperature-1 self-assembly

DOI10.1007/s11047-017-9662-xzbMath1528.68123OpenAlexW2776352619MaRDI QIDQ6061980

Andrew Winslow, Trent A. Rogers, Scott M. Summers, Matthew J. Patitz, Robert T. Schweller

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-017-9662-x

zbMATH Keywords

DNA computingbiocomputing2HAM

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
• Limitations of self-assembly at temperature 1
• An aperiodic hexagonal tile
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Optimal self-assembly of finite shapes at temperature 1 in 3D
• Producibility in hierarchical self-assembly
• The Power of Duples (in Self-Assembly): It’s Not So Hip to Be Square
• ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES
• Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
• The program-size complexity of self-assembled squares (extended abstract)
• Programmable Control of Nucleation for Algorithmic Self-Assembly
• Running time and program size for self-assembled squares
• Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
• Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems
• Intrinsic universality in tile self-assembly requires cooperation
• Complexity of Self‐Assembled Shapes
• The undecidability of the domino problem

This page was built for publication: Resiliency to multiple nucleation in temperature-1 self-assembly