The Tile Complexity of Linear Assemblies

DOI10.1007/978-3-642-02927-1_21MaRDI QIDQ3638038zbMATH OpenOpenAlexFDO

Authors Harish Chandran, Nikhil Gopalkrishnan, J. Reif

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_21

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Genetics and epigenetics (92D10)

Recommendations

• Tile Complexity of Linear Assemblies
• Randomized self-assembly for exact shapes
• Program size and temperature in self-assembly
• Nearly constant tile complexity for any shape in two-handed tile assembly
• An introduction to tile-based self-assembly

Cited in

(12)

• Computational modelling of the kinetic tile assembly model using a rule-based approach
• Tile complexity of approximate squares
• Nearly constant tile complexity for any shape in two-handed tile assembly
• One-dimensional staged self-assembly
• An introduction to tile-based self-assembly and a survey of recent results
• Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
• Tile Complexity of Linear Assemblies
• Random Number Selection in Self-assembly
• Aspects of a multivariate complexity analysis for rectangle tiling
• Parallelism and time in hierarchical self-assembly
• Parallelism and time in hierarchical self-assembly
• Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D

This page was built for publication: The Tile Complexity of Linear Assemblies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638038)