{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:59:42Z","timestamp":1743130782923,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540888680"},{"type":"electronic","value":"9783540888697"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-88869-7_11","type":"book-chapter","created":{"date-parts":[[2009,8,12]],"date-time":"2009-08-12T21:41:55Z","timestamp":1250113315000},"page":"185-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Self-assembly Model of Time-Dependent Glue Strength"],"prefix":"10.1007","author":[{"given":"Sudheer","family":"Sahu","sequence":"first","affiliation":[]},{"given":"Peng","family":"Yin","sequence":"additional","affiliation":[]},{"given":"John H.","family":"Reif","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,13]]},"reference":[{"key":"11_CR1","unstructured":"http:\/\/mrsec.wisc.edu\/edetc\/selfassembly\/"},{"key":"11_CR2","unstructured":"Adleman L (2000) Towards a mathematical theory of self-assembly. Tech Rep 00-722, University of Southern California"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1145\/380752.380881","volume-title":"Proceedings of the thirty-third annual ACM symposium on theory of computing","author":"L Adleman","year":"2001","unstructured":"Adleman L, Cheng Q, Goel A, Huang M (2001) Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on theory of computing. ACM, New York, pp 740\u2013748"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/509907.509913","volume-title":"Proceedings of the thirty-fourth annual ACM symposium on theory of computing","author":"L Adleman","year":"2002","unstructured":"Adleman L, Cheng Q, Goel A, Huang M, Kempe D, de Espans P, Rothemund P (2002) Combinatorial optimization problems in self-assembly. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing. ACM, New York, pp 23\u201332"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Adleman L, Kari J, Kari L, Reishus D (2002) On the decidability of self-assembly of infinite ribbons. In: Proceedings of the 43rd symposium on foundations of computer science, pp 530\u2013537","DOI":"10.1109\/SFCS.2002.1181977"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"24","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal G, Cheng Q, Goldwasser MH, Kao M, de Espanes PM, Schweller RT (2005) Complexities for generalized models of self-assembly. SIAM J Comput 24:1493\u20131515","journal-title":"SIAM J Comput"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s11047-007-9048-6","volume":"7","author":"S Angelov","year":"2008","unstructured":"Angelov S, Khanna S, Visontai M (2008) On the complexity of graph self-assembly in accretive systems. Nat Comput Int J Arch 7:183\u2013201","journal-title":"Nat Comput Int J Arch"},{"issue":"11","key":"11_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1126\/science.276.5310.233","volume":"276","author":"N Bowden","year":"1997","unstructured":"Bowden N, Terfort A, Carbeck J, Whitesides G (1997) Self-assembly of mesoscale objects into ordered two-dimensional arrays. Science 276(11):233\u2013235","journal-title":"Science"},{"issue":"24","key":"11_CR9","doi-asserted-by":"publisher","first-page":"248101","DOI":"10.1103\/PhysRevLett.90.248101","volume":"90","author":"R Bruinsma","year":"2003","unstructured":"Bruinsma R, Gelbart W, Reguera D, Rudnick J, Zandi R (2003) Viral self-assembly as a thermodynamic process. Phys Rev Lett 90(24):248101","journal-title":"Phys Rev Lett"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1021\/ja0458120","volume":"126","author":"N Chelyapov","year":"2004","unstructured":"Chelyapov N, Brun Y, Gopalkrishnan M, Reishus D, Shaw B, Adleman L (2004) DNA triangles and self-assembled hexagonal tilings. J Am Chem Soc 126:924\u2013925","journal-title":"J Am Chem Soc"},{"key":"11_CR11","unstructured":"Chen H, Cheng Q, Goel A, Huang M, de Espanes P (2004) Invadable self-assembly: combining robustness with efficiency. In: Proceedings of the 15th annual ACM\u2013SIAM symposium on discrete algorithms (SODA), pp 890\u2013899"},{"key":"11_CR12","unstructured":"Cheng Q, de Espanes P (2003) Resolving two open problems in the self-assembly of squares. Tech Rep 03-793, University of Southern California"},{"key":"11_CR13","unstructured":"Cheng Q, Goel A, Moisset P (2004) Optimal self-assembly of counters at temperature two. In: Proceedings of the first conference on foundations of nanoscience: self-assembled architectures and devices"},{"key":"11_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-540-24628-2_11","volume-title":"DNA based computers 9","author":"M Cook","year":"2004","unstructured":"Cook M, Rothemund PWK, Winfree E (2004) Self-assembled circuit patterns. In: DNA based computers 9. Lecture notes in computer science, vol 2943. Springer, Berlin, pp 91\u2013107"},{"key":"11_CR15","unstructured":"Feller W (1968) An introduction to probability theory and its applications, vol 1"},{"key":"11_CR16","first-page":"113","volume-title":"Lecture notes in computer science","author":"K Fujibayashi","year":"2005","unstructured":"Fujibayashi K, Murata S (2005) A method for error suppression for self-assembling DNA tiles. In: Lecture notes in computer science, vol 3384. Springer, Berlin, pp 113\u2013127"},{"key":"11_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537885.001.0001","volume-title":"Random walks and random environments, vol 1: random walks","author":"BD Hughes","year":"1995","unstructured":"Hughes BD (1995) Random walks and random environments, vol 1: random walks. Oxford University Press, New York"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/1109557.1109620","volume-title":"Proceedings of 17th annual ACM\u2013SIAM symposium on discrete algorithms (SODA)","author":"M Kao","year":"2006","unstructured":"Kao M, Schweller R (2006) Reduce complexity for tile self-assembly through temperature programming. In: Proceedings of 17th annual ACM\u2013SIAM symposium on discrete algorithms (SODA). ACM, New York, pp 571\u2013580"},{"key":"11_CR19","unstructured":"Klavins E (2004) Directed self-assembly using graph grammars. In: Foundations of nanoscience: self assembled architectures and devices, Snowbird, UT"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Klavins E, Ghrist R, Lipsky D (2004) Graph grammars for self-assembling robotic systems. In: Proceedings of the international conference on robotics and automation","DOI":"10.1109\/ROBOT.2004.1302558"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"1848","DOI":"10.1021\/ja993393e","volume":"122","author":"TH LaBean","year":"2000","unstructured":"LaBean TH, Yan H, Kopatsch J, Liu F, Winfree E, Reif JH, Seeman NC (2000) Construction, analysis, ligation and self-assembly of DNA triple crossover complexes. J Am Chem Soc 122:1848\u20131860","journal-title":"J Am Chem Soc"},{"key":"11_CR22","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1090\/dimacs\/054\/12","volume-title":"DNA based computers V","author":"M Lagoudakis","year":"2000","unstructured":"Lagoudakis M, LaBean T (2000) 2-D DNA self-assembly for satisfiability. In: DNA based computers V. DIMACS, vol 54. American Mathematical Society, Providence, pp 141\u2013154"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"2324","DOI":"10.1021\/ja031754r","volume":"126","author":"D Liu","year":"2004","unstructured":"Liu D, Wang M, Deng Z, Walulu R, Mao C (2004) Tensegrity: construction of rigid DNA triangles with flexible four-arm DNA junctions. J Am Chem Soc 126:2324\u20132325","journal-title":"J Am Chem Soc"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"5437","DOI":"10.1021\/ja9900398","volume":"121","author":"C Mao","year":"1999","unstructured":"Mao C, Sun W, Seeman NC (1999) Designed two-dimensional DNA holliday junction arrays visualized by atomic force microscopy. J Am Chem Soc 121:5437\u20135443","journal-title":"J Am Chem Soc"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1002\/anie.200503797","volume":"45","author":"SH Park","year":"2006","unstructured":"Park SH, Pistol C, Ahn SJ, Reif JH, Lebeck AR, Dwyer C, LaBean TH (2006) Finite-size, fully addressable DNA tile lattices formed by hierarchical assembly procedures. Angew Chem Int Ed 45:735\u2013739","journal-title":"Angew Chem Int Ed"},{"key":"11_CR26","first-page":"257","volume-title":"Lecture notes in computer science","author":"JH Reif","year":"2005","unstructured":"Reif JH, Sahu S, Yin P (2005) Complexity of graph self-assembly in accretive systems and self-destructible systems. In: Lecture notes in computer science. Springer, Berlin, pp 257\u2013274"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Reif JH, Sahu S, Yin P (2006). Compact error-resilient computational DNA tilings. In: Nanotechnology: science and computation, pp 79\u2013103","DOI":"10.1007\/3-540-30296-4_5"},{"key":"11_CR28","doi-asserted-by":"crossref","DOI":"10.1142\/1107","volume-title":"Random walk in random and non-random environments","author":"P Revesz","year":"1990","unstructured":"Revesz P (1990) Random walk in random and non-random environments. World Scientific, Singapore"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"R Robinson","year":"1971","unstructured":"Robinson R (1971) Undecidability and non periodicity of tilings of the plane. Invent Math 12:177\u2013209","journal-title":"Invent Math"},{"issue":"3","key":"11_CR30","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1073\/pnas.97.3.984","volume":"97","author":"P Rothemund","year":"2000","unstructured":"Rothemund P (2000) Using lateral capillary forces to compute by self-assembly. Proc Natl Acad Sci USA 97(3):984\u2013989","journal-title":"Proc Natl Acad Sci USA"},{"key":"11_CR31","unstructured":"Rothemund P (2001) Theory and experiments in algorithmic self-assembly. PhD thesis, University of Southern California"},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/335305.335358","volume-title":"Proceedings of the thirty-second annual ACM symposium on theory of computing","author":"P Rothemund","year":"2000","unstructured":"Rothemund P, 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. ACM, New York, pp 459\u2013468"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/B:NACO.0000006771.95566.34","volume":"2","author":"P Sa-Ardyen","year":"2003","unstructured":"Sa-Ardyen P, Jonoska N, Seeman NC (2003) Self-assembling DNA graphs. Nat Comput 2:427\u2013438","journal-title":"Nat Comput"},{"key":"11_CR34","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-24628-2_12","volume-title":"DNA based computers 9","author":"R Schulman","year":"2004","unstructured":"Schulman R, Lee S, Papadakis N, Winfree E (2004) One dimensional boundaries for DNA tile self-assembly. In: DNA based computers 9. Lecture notes in computer science, vol 2943. Springer, Berlin, pp 108\u2013125"},{"key":"11_CR35","first-page":"319","volume-title":"Lecture notes in computer science","author":"R Schulman","year":"2005","unstructured":"Schulman R, Winfree E (2005) Programmable control of nucleation for algorithmic self-assembly. In: Lecture notes in computer science, vol 3384. Springer, Berlin, pp 319\u2013328"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Schulman R, Winfree E (2005) Self-replication and evolution of DNA crystals. In: The 13th European conference on artificial life (ECAL)","DOI":"10.1007\/11553090_74"},{"key":"11_CR37","first-page":"305","volume-title":"Lecture notes in computer science","author":"D Soloveichik","year":"2006","unstructured":"Soloveichik D, Winfree E (2006) Complexity of compact proofreading for self-assembled patterns. In: Lecture notes in computer science, vol 3892. Springer, Berlin, pp 305\u2013324"},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D Soloveichik","year":"2007","unstructured":"Soloveichik D, Winfree E (2007) Complexity of self-assembled shapes. SIAM J Comput 36:1544\u20131569","journal-title":"SIAM J Comput"},{"key":"11_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H Wang","year":"1961","unstructured":"Wang H (1961) Proving theorems by pattern recognition, II. Bell Syst Tech J 40:1\u201341","journal-title":"Bell Syst Tech J"},{"key":"11_CR40","unstructured":"Winfree E (1998) Simulation of computing by self-assembly. Tech Rep 1998.22, Caltech"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Winfree E (2006). Self-healing tile sets. In: Nanotechnology: science and computation, pp\u00a055\u201378","DOI":"10.1007\/3-540-30296-4_4"},{"key":"11_CR42","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-540-24628-2_13","volume-title":"DNA based computers 9","author":"E Winfree","year":"2004","unstructured":"Winfree E, Bekbolatov R (2004) Proofreading tile sets: error correction for algorithmic self-assembly. In: DNA based computers 9. Lecture notes in computer science, vol 2943. Springer, Berlin, pp\u00a0126\u2013144"},{"issue":"6693","key":"11_CR43","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E Winfree","year":"1998","unstructured":"Winfree E, Liu F, Wenzler LA, Seeman NC (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394(6693):539\u2013544","journal-title":"Nature"},{"key":"11_CR44","series-title":"DIMACS","first-page":"191","volume-title":"DNA based computers II","author":"E Winfree","year":"1999","unstructured":"Winfree E, Yang X, Seeman NC (1999) Universal computation via self-assembly of DNA: some theory and experiments. In: Landweber L, Baum E (eds) DNA based computers II. DIMACS, vol 44. American Mathematical Society, Providence, pp 191\u2013213"},{"issue":"14","key":"11_CR45","doi-asserted-by":"publisher","first-page":"8103","DOI":"10.1073\/pnas.1032954100","volume":"100","author":"H Yan","year":"2003","unstructured":"Yan H, LaBean TH, Feng L, Reif JH (2003) Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices. Proc Natl Acad Sci USA 100(14):8103\u20138108","journal-title":"Proc Natl Acad Sci USA"},{"issue":"5641","key":"11_CR46","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.1126\/science.1089389","volume":"301","author":"H Yan","year":"2003","unstructured":"Yan H, Park SH, Finkelstein G, Reif JH, LaBean TH (2003) DNA-templated self-assembly of protein arrays and highly conductive nanowires. Science 301(5641):1882\u20131884","journal-title":"Science"}],"container-title":["Natural Computing Series","Algorithmic Bioprocesses"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88869-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T21:03:30Z","timestamp":1710536610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88869-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540888680","9783540888697"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88869-7_11","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"13 August 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}