Programmable Control of Nucleation for Algorithmic Self-Assembly
From MaRDI portal
Publication:3586192
DOI10.1137/070680266zbMath1205.68497arXivcond-mat/0607317MaRDI QIDQ3586192
Erik Winfree, Rebecca Schulman
Publication date: 6 September 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0607317
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
82D25: Statistical mechanics of crystals
Related Items
Parallelism and Time in Hierarchical Self-Assembly, An introduction to tile-based self-assembly and a survey of recent results, Search methods for tile sets in patterned DNA self-assembly, Complexity of graph self-assembly in accretive systems and self-destructible systems, Capabilities and limits of compact error resilience methods for algorithmic self-assembly, On the complexity of graph self-assembly in accretive systems, Pictures worth a thousand tiles, a geometrical programming language for self-assembly, Computational modelling of the kinetic tile assembly model using a rule-based approach, Tile complexity of approximate squares, Simple evolution of complex crystal species, Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly, Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems, A Brief Tour of Theoretical Tile Self-Assembly, Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems, A Self-assembly Model of Time-Dependent Glue Strength, Complexity of Compact Proofreading for Self-assembled Patterns
