{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:11:42Z","timestamp":1743091902537,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218182"},{"type":"electronic","value":"9783319218199"}],"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-21819-9_20","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T11:16:31Z","timestamp":1438600591000},"page":"263-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-cooperative Algorithms in Self-assembly"],"prefix":"10.1007","author":[{"given":"Pierre-\u00c9tienne","family":"Meunier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jcta.2009.10.001","volume":"117","author":"M Bousquet-M\u00e9lou","year":"2010","unstructured":"Bousquet-M\u00e9lou, M.: Families of prudent self-avoiding walks. J. Comb. Theory Ser. A 117(3), 313\u2013344 (2010)","journal-title":"J. Comb. Theory Ser. A"},{"key":"20_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007). http:\/\/www.grappa.univ-lille3.fr\/tata. Accessed 12 October 2007"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.T.: Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of SODA 2011, pp. 570\u2013589 (2011). Arxiv preprint: arXiv:0912.0027","DOI":"10.1137\/1.9781611973082.45"},{"key":"20_CR4","volume-title":"Principles of Polymer Chemistry","author":"PJ Flory","year":"1953","unstructured":"Flory, P.J.: Principles of Polymer Chemistry. Cornell University, Ithaca (1953)"},{"key":"20_CR5","first-page":"210","volume":"2","author":"DE Knuth","year":"1984","unstructured":"Knuth, D.E.: Mathematics and computer science: coping with finiteness. Math. People Prob. Results 2, 210\u2013211 (1984)","journal-title":"Math. People Prob. Results"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC 2000, Portland, Oregon, United States, pp. 459\u2013468. ACM (2000)","DOI":"10.1145\/335305.335358"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"NC Seeman","year":"1982","unstructured":"Seeman, N.C.: Nucleic-acid junctions and lattices. J. Theor. Biol. 99, 237\u2013247 (1982)","journal-title":"J. Theor. Biol."},{"key":"20_CR8","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-01928-4_13","volume-title":"DNA Computing and Molecular Programming","author":"A Winslow","year":"2013","unstructured":"Winslow, A.: Staged self-assembly and polyomino context-free grammars. In: Soloveichik, D., Yurke, B. (eds.) DNA 2013. LNCS, vol. 8141, pp. 174\u2013188. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21819-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:53:51Z","timestamp":1676973231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21819-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218182","9783319218199"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21819-9_20","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":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}