On Times to Compute Shapes in 2D Tile Self-assembly
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved during the self-assembly. Our earlier work was confined to the growth of rectangular structures, in which the border tiles are prefabricated. By varying the relative rates between the border-tile and rule-tile attachment, one can engineer interesting new shapes, which have been observed in the laboratory. We show that the results from an extension of our earlier stochastic models agree remarkably closely with experimental results. This is an important further demonstration of the validity and usefulness of our stochastic models, which have also been used successfully in studies of error correction in DNA self assembly.
KeywordsAttachment Rate Boundary Growth Positive Lattice Intermediate Shape Extremal Path
Unable to display preview. Download preview PDF.
- 1.Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena, CA (1998)Google Scholar
- 2.Adleman, L., Cheng, Q., Goel, A., Huang, M.D., Wasserman, H.: Linear self-assemblies: Equilibria, entropy, and convergence rates. In: Elaydi, Ladas, Aulbach (eds.) New progress in difference equations, Taylor and Francis, London (2004)Google Scholar
- 3.Baryshnikov, Y., Coffman, E., Momčilović, P.: Incremental self-assembly in the fluid limit. In: Proc. 38th Ann. Conf. Inf. Sys. Sci., Princeton, NJ (2004)Google Scholar
- 4.Baryshnikov, Y., Coffman, E., Momčilović, P.: DNA-based computation times. In: Proc. of the Tenth International Meeting on DNA Computing, Milan, Italy (2004)Google Scholar
- 5.Baryshnikov, Y., Coffman, E., Seeman, N., Yimwadsana, B.: Self correcting self assembly: Growth models and the hammersley process. In: Proc. of the Eleventh International Meeting on DNA Computing, London, Ontario (2005)Google Scholar
- 9.Adleman, L., Cheng, Q., Goel, A., Huang, M.D., Kempe, D., de Espanés, P.M., Rothemund, P.: Combinatorial optimization problems in self-assembly. In: Proc. ACM Symp. Th. Comput., Montreal, Canada, pp. 23–32 (2002)Google Scholar
- 10.Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proc. ACM Symp. Th. Comput., pp. 740–748 (2001)Google Scholar
- 11.Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proc. ACM Symp. Th. Comput., pp. 459–468 (2001)Google Scholar
- 12.Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Proc. of the Tenth International Meeting on DNA Computing (2004)Google Scholar