Programmable Control of Nucleation for Algorithmic Self-Assembly

From MaRDI portal
Publication:3586192

DOI10.1137/070680266zbMath1205.68497arXivcond-mat/0607317OpenAlexW2077771699MaRDI 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




Related Items (22)

Simple evolution of complex crystal speciesCapabilities and limits of compact error resilience methods for algorithmic self-assemblyA Brief Tour of Theoretical Tile Self-AssemblyComputational modelling of the kinetic tile assembly model using a rule-based approachSearch methods for tile sets in patterned DNA self-assemblyResiliency to multiple nucleation in temperature-1 self-assemblyComplexity of graph self-assembly in accretive systems and self-destructible systemsTile complexity of approximate squaresOn the complexity of graph self-assembly in accretive systemsOn the effects of hierarchical self-assembly for reducing program-size complexityNearly constant tile complexity for any shape in two-handed tile assemblyProducibility in hierarchical self-assemblyParallelism and Time in Hierarchical Self-AssemblyOptimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly SystemsComplexity of Graph Self-assembly in Accretive Systems and Self-destructible SystemsA Self-assembly Model of Time-Dependent Glue StrengthComplexity of Compact Proofreading for Self-assembled PatternsPictures worth a thousand tiles, a geometrical programming language for self-assemblyActivatable tiles for compact robust programmable molecular assembly and other applicationsComputing properties of stable configurations of thermodynamic binding networksResiliency to Multiple Nucleation in Temperature-1 Self-AssemblyAn introduction to tile-based self-assembly and a survey of recent results




This page was built for publication: Programmable Control of Nucleation for Algorithmic Self-Assembly