{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:33:09Z","timestamp":1771036389733,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T00:00:00Z","timestamp":1535587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["CCF-1817602"],"award-info":[{"award-number":["CCF-1817602"]}]},{"name":"National Science Foundation","award":["CCF-1555626"],"award-info":[{"award-number":["CCF-1555626"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11047-018-9707-9","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T05:43:35Z","timestamp":1535607815000},"page":"93-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Self-assembly of shapes at constant scale using repulsive forces"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8180-9762","authenticated-orcid":false,"given":"Austin","family":"Luchsinger","sequence":"first","affiliation":[]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"key":"9707_CR1","doi-asserted-by":"crossref","unstructured":"Chalk C, Demiane ED, Demaine ML, Martinez E, Schweller R, Vega L, Wylie T (2017) Universal shape replicators via self-assembly with attractive and repulsive forces. In: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms (SODA\u201917)","DOI":"10.1137\/1.9781611974782.15"},{"key":"9707_CR2","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704446037","volume":"34","author":"Q Cheng","year":"2005","unstructured":"Cheng Q, Aggarwal G, Goldwasser MH, Kao MY, Schweller RT, de Espan\u00e9s PM (2005) Complexities for generalized models of self-assembly. SIAM J Comput 34:1493\u20131515","journal-title":"SIAM J Comput"},{"issue":"3","key":"9707_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"ED Demaine","year":"2008","unstructured":"Demaine ED, Demaine ML, Fekete SP, Ishaque M, Rafalin E, Schweller RT, Souvaine DL (2008) Staged self-assembly: nanomanufacture of arbitrary shapes with \n                    \n                      \n                    \n                    $${O}(1)$$\n                    \n                      \n                        \n                          O\n                          (\n                          1\n                          )\n                        \n                      \n                    \n                   glues. Nat Comput 7(3):347\u2013370","journal-title":"Nat Comput"},{"key":"9707_CR4","doi-asserted-by":"publisher","unstructured":"Demaine ED, Fekete SP, Scheffer C, Schmidt A (2015) New geometric algorithms for fully connected staged self-assembly. DNA computing and molecular programming, lecture notes in computer science, vol 9211, pp 104\u2013116. \n                    https:\/\/doi.org\/10.1007\/978-3-319-21999-8_7","DOI":"10.1007\/978-3-319-21999-8_7"},{"key":"9707_CR5","unstructured":"Demaine ED, Patitz MJ, Schweller RT, Summers SM (2011) Self-assembly of arbitrary shapes using RNAse enzymes: meeting the Kolmogorov bound with small scale factor (extended abstract). In: Proceedings of the 28th international symposium on theoretical aspects of computer science (STACS\u201911)"},{"issue":"1","key":"9707_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-012-9631-9","volume":"66","author":"D Doty","year":"2013","unstructured":"Doty D, Kari L, Masson B (2013) Negative interactions in irreversible self-assembly. Algorithmica 66(1):153\u2013172. \n                    https:\/\/doi.org\/10.1007\/s00453-012-9631-9","journal-title":"Algorithmica"},{"issue":"3","key":"9707_CR7","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s11047-012-9321-1","volume":"11","author":"J Mauch","year":"2012","unstructured":"Mauch J, Stacho L, Stoll C (2012) Step-wise tile assembly with a constant number of tile types. Nat Comput 11(3):535\u2013550. \n                    https:\/\/doi.org\/10.1007\/s11047-012-9321-1","journal-title":"Nat Comput"},{"key":"9707_CR8","volume-title":"DNA computing and molecular programming","author":"MJ Patitz","year":"2016","unstructured":"Patitz MJ, Rogers TA, Schweller R, Summers SM, Winslow A (2016) Resiliency to multiple nucleation in temperature-1 self-assembly. In: Rondelez Y, Woods D (eds) DNA computing and molecular programming. Springer, Berlin"},{"key":"9707_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-23638-9_15","volume":"6937","author":"MJ Patitz","year":"2011","unstructured":"Patitz MJ, Schweller RT, Summers SM (2011) Exact shapes and Turing Universality at temperature 1 with a single negative glue. DNA Comput Mol Program 6937:175\u2013189. \n                    https:\/\/doi.org\/10.1007\/978-3-642-23638-9_15","journal-title":"DNA Comput Mol Program"},{"issue":"17","key":"9707_CR10","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.tcs.2010.10.034","volume":"412","author":"JH Reif","year":"2011","unstructured":"Reif JH, Sahu S, Yin P (2011) Complexity of graph self-assembly in accretive systems and self-destructible systems. Theoretical Comp Sci 412(17):1592\u20131605. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2010.10.034","journal-title":"Theoretical Comp Sci"},{"issue":"3","key":"9707_CR11","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1073\/pnas.97.3.984","volume":"97","author":"PWK Rothemund","year":"2000","unstructured":"Rothemund PWK (2000) Using lateral capillary forces to compute by self-assembly. Proc Nat Acad Sci 97(3):984\u2013989. \n                    https:\/\/doi.org\/10.1073\/pnas.97.3.984","journal-title":"Proc Nat Acad Sci"},{"key":"9707_CR12","unstructured":"Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the 32nd ACM symposium on theory of computing, STOC\u201900, pp 459\u2013468"},{"key":"9707_CR13","doi-asserted-by":"publisher","unstructured":"Schiefer N, Winfree E (2015) Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model. Springer, Cham, pp 34\u201354. \n                    https:\/\/doi.org\/10.1007\/978-3-319-21999-8_3","DOI":"10.1007\/978-3-319-21999-8_3"},{"key":"9707_CR14","doi-asserted-by":"crossref","unstructured":"Schweller R, Sherman M (2013) Fuel efficient computation in passive self-assembly. In: SODA 2013: proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 1513\u20131525","DOI":"10.1137\/1.9781611973105.109"},{"issue":"6","key":"9707_CR15","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(6):1544\u20131569","journal-title":"SIAM J Comput"},{"issue":"1","key":"9707_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00453-011-9522-5","volume":"63","author":"SM Summers","year":"2012","unstructured":"Summers SM (2012) Reducing tile complexity for the self-assembly of scaled shapes through temperature programming. Algorithmica 63(1):117\u2013136","journal-title":"Algorithmica"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-018-9707-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9707-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9707-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T01:37:47Z","timestamp":1589938667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-018-9707-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,30]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["9707"],"URL":"https:\/\/doi.org\/10.1007\/s11047-018-9707-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,30]]},"assertion":[{"value":"30 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}