Years and Authors of Summarized Original Work
-
2005; Aggarwal, Cheng, Goldwasser, Kao, Moisset de Espanés, Schweller
-
2006; Kao, Schweller
-
2012; Summers
Problem Definition
Self-assembly is a process by which a small number of fundamental components automatically coalesce to form a target structure. In 1998, Winfree [10] introduced the abstract Tile Assembly Model (aTAM) as a deliberately over-simplified, discrete mathematical model of the DNA tile self-assembly pioneered by Seeman [6]. The aTAM “effectivizes” classical Wang tiling [9] in the sense that the former augments the latter with a mechanism for sequential “growth” of a tile assembly. Very briefly, in the aTAM, the fundamental components are un-rotatable, translatable square “tile types” whose sides are labeled with (alpha-numeric) glue “colors” and (integer) “strengths.” Two tiles that are placed next to each other bindif the glues on their abutting sides match in both color and strength, and the common strength is at least a...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Adleman L, Cheng Q, Goel A, Huang MD (2001) Running time and program size for self-assembled squares. In: Proceedings of the 33rd annual ACM symposium on theory of computing, Heraklion, pp 740–748
Cheng Q, Aggarwal G, Goldwasser MH, Kao MY, Schweller RT, de Espanés PM (2005) Complexities for generalized models of self-assembly. SIAM J Comput 34:1493–1515
Kao MY, Schweller RT (2006) Reducing tile complexity for self-assembly through temperature programming. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms, Miami, pp 571–580
Li M, Vitanyi P (1997) An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, New York
Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the thirty-second annual ACM symposium on theory of computing, Portland, pp 459–468
Seeman NC (1982) Nucleic-acid junctions and lattices. J Theor Biol 99:237–247
Soloveichik D, Winfree E (2007) Complexity of self-assembled shapes. SIAM J Comput 36(6):1544–1569
Summers SM (2012) Reducing tile complexity for the self-assembly of scaled shapes through temperature programming. Algorithmica 63(1–2):117–136
Wang H (1961) Proving theorems by pattern recognition – II. Bell Syst Tech J XL(1):1–41
Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Summers, S.M. (2016). Temperature Programming in Self-Assembly. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_670
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_670
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering