Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems

DOI10.1007/s11047-015-9516-3zbMath1415.68101arXiv1404.7410OpenAlexW1550621477MaRDI QIDQ2003454

Andrew Winslow

Publication date: 8 July 2019

Published in: Natural Computing, Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.7410

zbMATH Keywords

2HAMhierarchicalaTAMgel electrophoresisglues

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09)

Related Items (1)

Optimal staged self-assembly of linear assemblies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Polyomino-safe DNA self-assembly via block replacement
• Staged self-assembly and polyomino context-free grammars
• Producibility in Hierarchical Self-assembly
• Intrinsic Universality in Self-Assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Computability and Complexity in Self-assembly
• Polyomino-Safe DNA Self-assembly via Block Replacement
• Limitations of Self-assembly at Temperature One
• Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
• Intrinsic universality in tile self-assembly requires cooperation
• Complexity of Self‐Assembled Shapes

This page was built for publication: Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems