Reducing tile complexity for the self-assembly of scaled shapes through temperature programming

DOI10.1007/s00453-011-9522-5zbMath1329.68152arXiv0907.1307MaRDI QIDQ2429337

Scott M. Summers

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

Kolmogorov complexity; self-assembly; bio-molecular computation; temperature programming

Mathematics Subject Classification ID

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

92C99: Physiological, cellular and medical topics

Related Items

A Study on Complexity Measure of Diamond Tile Self-assembly System, Parallel Computation Using Active Self-assembly, Iterative Self-assembly with Dynamic Strength Transformation and Temperature Control, Unnamed Item, Parallelism and Time in Hierarchical Self-Assembly, The need for seed (in the abstract Tile Assembly Model), An introduction to tile-based self-assembly and a survey of recent results, Program size and temperature in self-assembly, Step-wise tile assembly with a constant number of tile types, Nearly constant tile complexity for any shape in two-handed tile assembly, Parallel computation using active self-assembly, The complexity of multiple handed self-assembly, Self-assembly of shapes at constant scale using repulsive forces, Self-assembly of 4-sided fractals in the two-handed tile assembly model, Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Strict self-assembly of discrete Sierpinski triangles
• Intrinsic Universality in Self-Assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Randomized Self-assembly for Approximate Shapes
• Reducing tile complexity for self-assembly through temperature programming
• Running time and program size for self-assembled squares
• On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Randomized Self-Assembly for Exact Shapes
• Complexity of Self‐Assembled Shapes
• DNA Computing
• DNA Computing