{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:57Z","timestamp":1725686697567},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308697"},{"type":"electronic","value":"9783642308703"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_55","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T02:56:12Z","timestamp":1338173772000},"page":"549-559","source":"Crossref","is-referenced-by-count":0,"title":["On the Behavior of Tile Assembly System at High Temperatures"],"prefix":"10.1007","author":[{"given":"Shinnosuke","family":"Seki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasushi","family":"Okuno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proc. of STOC 2001, pp. 740\u2013748. ACM (2001)","key":"55_CR1","DOI":"10.1145\/380752.380881"},{"doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.D., Kempe, D., de Espan\u00e9s, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proc. of STOC 2002, pp. 23\u201332 (2002)","key":"55_CR2","DOI":"10.1145\/509909.509913"},{"issue":"15","key":"55_CR3","doi-asserted-by":"publisher","first-page":"6054","DOI":"10.1073\/pnas.0808736106","volume":"106","author":"R.D. Barish","year":"2009","unstructured":"Barish, R.D., Schulman, R., Rothemund, P.W., Winfree, E.: An information-bearing seed for nucleating algorithmic self-assembly. Proceedings of the National Academy of Sciences\u00a0106(15), 6054\u20136059 (2009)","journal-title":"Proceedings of the National Academy of Sciences"},{"doi-asserted-by":"crossref","unstructured":"Bryans, N., Chiniforooshan, E., Doty, D., Kari, L., Seki, S.: The power of nondeterminism in self-assembly. In: Proc. of SODA 2011, pp. 590\u2013602 (2011)","key":"55_CR4","DOI":"10.1137\/1.9781611973082.46"},{"key":"55_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-25591-5_46","volume-title":"Algorithms and Computation","author":"H.L. Chen","year":"2011","unstructured":"Chen, H.L., Doty, D., Seki, S.: Program Size and Temperature in Self-Assembly. In: Asano, T., Nakano, S.-I., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 445\u2013453. Springer, Heidelberg (2011)"},{"issue":"9","key":"55_CR6","doi-asserted-by":"publisher","first-page":"2913","DOI":"10.1021\/nl070793o","volume":"7","author":"H.L. Chen","year":"2007","unstructured":"Chen, H.L., Schulman, R., Goel, A., Winfree, E.: Reducing facet nucleation during algorithmic self-assembly. Nano Letters\u00a07(9), 2913\u20132919 (2007)","journal-title":"Nano Letters"},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1021\/bi00064a003","volume":"32","author":"T.J. Fu","year":"1993","unstructured":"Fu, T.J., Seeman, N.C.: DNA double-crossover molecules. Biochemistry\u00a032, 3211\u20133220 (1993)","journal-title":"Biochemistry"},{"issue":"7","key":"55_CR8","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1021\/nl0722830","volume":"8","author":"K. Fujibayashi","year":"2009","unstructured":"Fujibayashi, K., Hariadi, R., Park, S.H., Winfree, E., Murata, S.: Toward reliable algorithmic self-assembly of DNA tiles: A fixed-width cellular automaton pattern. Nano Letters\u00a08(7), 1791\u20131797 (2009)","journal-title":"Nano Letters"},{"doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proc. of STOC 2000, pp. 459\u2013468 (2000)","key":"55_CR9","DOI":"10.1145\/335305.335358"},{"doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of STOC 1978, pp. 216\u2013226 (1978)","key":"55_CR10","DOI":"10.1145\/800133.804350"},{"key":"55_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"N.C. Seeman","year":"1982","unstructured":"Seeman, N.C.: Nucleic-acid junctions and lattices. Journal of Theoretical Biology\u00a099, 237\u2013247 (1982)","journal-title":"Journal of Theoretical Biology"},{"doi-asserted-by":"crossref","unstructured":"Wang, H.: Proving theorems by pattern recognition - II. The Bell System Technical Journal XL\u00a0(1), 1\u201341 (1961)","key":"55_CR12","DOI":"10.1002\/j.1538-7305.1961.tb03975.x"},{"unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology (June 1998)","key":"55_CR13"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:32:36Z","timestamp":1620127956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}