Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena, CA (1998)
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)
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)
Baryshnikov, Y., Coffman, E., Momčilović, P.: DNA-based computation times. In: Proc. of the Tenth International Meeting on DNA Computing, Milan, Italy (2004)
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)
Ding, B., Sha, R., Seeman, N.: Pseudohexagonal 2D DNA crystals from double crossover cohesion. J. Am. Chem. Soc. 126, 10230–10231 (2004)
Fu, T.J., Seeman, N.: DNA double crossover structures. Biochemistry 32, 3211–3220 (1993)
Liggett, T.M.: Interacting Particle Systems. Springer, New York (1985)
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)
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)
Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proc. ACM Symp. Th. Comput., pp. 459–468 (2001)
Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Proc. of the Tenth International Meeting on DNA Computing (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baryshnikov, Y., Coffman, E., Yimwadsana, B. (2006). On Times to Compute Shapes in 2D Tile Self-assembly. In: Mao, C., Yokomori, T. (eds) DNA Computing. DNA 2006. Lecture Notes in Computer Science, vol 4287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925903_16
Download citation
DOI: https://doi.org/10.1007/11925903_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49024-1
Online ISBN: 978-3-540-68423-7
eBook Packages: Computer ScienceComputer Science (R0)