Reducing tile complexity for self-assembly through temperature programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Arithmetic computation in the tile assembly model: Addition and multiplication
Theoretical Computer Science
Nondeterministic polynomial time factoring in the tile assembly model
Theoretical Computer Science
Solving NP-complete problems in the tile assembly model
Theoretical Computer Science
Combining self-healing and proofreading in self-assembly
Natural Computing: an international journal
Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues
Natural Computing: an international journal
Solving satisfiability in the tile assembly model with a constant-size tileset
Journal of Algorithms
Path finding in the tile assembly model
Theoretical Computer Science
The 4-way deterministic tiling problem is undecidable
Theoretical Computer Science
Efficient Algorithms for Self Assembling Triangular and Other Nano Structures
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Step-Assembly with a Constant Number of Tile Types
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Polyomino-safe DNA self-assembly via block replacement
Natural Computing: an international journal
Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues
DNA13'07 Proceedings of the 13th international conference on DNA computing
Self-assembly of infinite structures: A survey
Theoretical Computer Science
Negative interactions in irreversible self-assembly
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Randomized self assembly of rectangular nano structures
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
Natural Computing: an international journal
Efficient algorithms for self assembling non-rectangular nano structures
Natural Computing: an international journal
Self-assembly of decidable sets
Natural Computing: an international journal
Parallelism and time in hierarchical self-assembly
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The power of nondeterminism in self-assembly
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Flexible word design and graph labeling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Natural Computing: an international journal
Natural Computing: an international journal
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
Self-assembly with geometric tiles
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Theory of algorithmic self-assembly
Communications of the ACM
Step-wise tile assembly with a constant number of tile types
Natural Computing: an international journal
An introduction to tile-based self-assembly
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Deterministic polynomial-time algorithms for designing short DNA words
Theoretical Computer Science
The two-handed tile assembly model is not intrinsically universal
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.02 |
In this paper, we study the complexity of self-assembly under models that are natural generalizations of the tile self-assembly model. In particular, we extend Rothemund and Winfree's study of the tile complexity of tile self-assembly [Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 459--468]. They provided a lower bound of $\Omega(\frac{\log N}{\log\log N})$ on the tile complexity of assembling an $N\times N$ square for almost all N. Adleman et al. [Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Greece, 2001, pp. 740--748] gave a construction which achieves this bound. We consider whether the tile complexity for self-assembly can be reduced through several natural generalizations of the model. One of our results is a tile set of size $O(\sqrt{\log N})$ which assembles an $N\times N$ square in a model which allows flexible glue strength between nonequal glues. This result is matched for almost all N by a lower bound dictated by Kolmogorov complexity. For three other generalizations, we show that the $\Omega(\frac{\log N}{\log\log N})$ lower bound applies to $N\times N$ squares. At the same time, we demonstrate that there are some other shapes for which these generalizations allow reduced tile sets. Specifically, for thin rectangles with length N and width k, we provide a tighter lower bound of $\Omega(\frac{N^{1/k}}{k})$ for the standard model, yet we also give a construction which achieves $O(\frac{\log N}{\log\log N})$ complexity in a model in which the temperature of the tile system is adjusted during assembly. We also investigate the problem of verifying whether a given tile system uniquely assembles into a given shape; we show that this problem is NP-hard for three of the generalized models.