{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:20Z","timestamp":1742914160445,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319219981"},{"type":"electronic","value":"9783319219998"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21999-8_5","type":"book-chapter","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T19:00:01Z","timestamp":1437418801000},"page":"71-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D"],"prefix":"10.1007","author":[{"given":"David","family":"Furcy","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Micka","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: STOC, Huang, pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.: Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. In: SODA 2011: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2011)","DOI":"10.1137\/1.9781611973082.45"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2010.08.023","volume":"412","author":"D Doty","year":"2011","unstructured":"Doty, D., Patitz, M.J., Summers, S.M.: Limitations of self-assembly at temperature 1. Theor. Comput. Sci. 412, 145\u2013158 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and its Applications, 3rd edn. Springer, New York (2008)","edition":"3"},{"issue":"6","key":"5_CR5","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1089\/cmb.2009.0067","volume":"17","author":"J Manuch","year":"2010","unstructured":"Manuch, J., Stacho, L., Stoll, C.: Two lower bounds for self-assemblies at temperature 1. J. Comput. Biol. 17(6), 841\u2013852 (2010)","journal-title":"J. Comput. Biol."},{"key":"5_CR6","unstructured":"Presburger, Moj\u017cesz: \u00dcber die vollst\u00e4ndigkeit eines gewissen systems der arithmetik ganzer zahlen, welchem die addition als einzige operation hervortritt. In: Compte-Rendus du Premier Congr\u00e8s des Math\u00e9maticiens des Pays Slaves, Warsaw, pp. 92\u2013101 (1930)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Rothemund, P. W., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC 2000: Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM J. Comput. 36(6), 1544\u20131569 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition - II. Bell Syst. Tech. J. XL 40(1), 1\u201341 (1961)","journal-title":"Bell Syst. Tech. J. XL"},{"key":"5_CR10","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21999-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:47:41Z","timestamp":1676026061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21999-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319219981","9783319219998"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21999-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"21 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}