The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing
Reducing tile complexity for self-assembly through temperature programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complexity of Self-Assembled Shapes
SIAM Journal on Computing
Randomized Self-assembly for Approximate Shapes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
| Hi-index | 0.00 |
Nano fabrication with biomolecular/DNA self assembly is a promising area of research. Building nano structures with self assembly is both efficient and inexpensive. Winfree [1] formalized a two dimensional (2D) tile assembly model based on Wang’s tiling technique. Algorithms with an optimal tile complexity of ($\Theta(\frac{\log(N)}{\log(\log(N))})$) were proposed earlier to uniquely self assemble an N×N square (with a temperature of α= 2) on this model. However efficient constructions to assemble arbitrary shapes are not known and have remained open. In this paper we present self assembling algorithms to assemble a triangle of base 2N − 1 (units) and height N with a tile complexity of Θ(log(N)). We also describe how this framework can be used to construct other shapes.