Producibility in hierarchical self-assembly

DOI10.1007/s11047-015-9517-2zbMath1415.68079arXiv1304.7804OpenAlexW2149356807MaRDI QIDQ2003445

David Doty

Publication date: 8 July 2019

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

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

zbMATH Keywords

deterministicself-assemblyhierarchical

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Resiliency to multiple nucleation in temperature-1 self-assembly, Parallelism and Time in Hierarchical Self-Assembly

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• 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
• Strict self-assembly of discrete Sierpinski triangles
• Identifying shapes using self-assembly
• Staged self-assembly and polyomino context-free grammars
• Self-assembly with Geometric Tiles
• One-Dimensional Staged Self-assembly
• Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• Programmable Control of Nucleation for Algorithmic Self-Assembly
• An Introduction to Tile-Based Self-assembly
• Complexities for Generalized Models of Self-Assembly
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
• Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems
• Fuel Efficient Computation in Passive Self-Assembly