{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:22Z","timestamp":1740136162627,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T00:00:00Z","timestamp":1557100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T00:00:00Z","timestamp":1557100800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1555626","1555626"],"award-info":[{"award-number":["1555626","1555626"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1817602","1817602"],"award-info":[{"award-number":["1817602","1817602"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1117672"],"award-info":[{"award-number":["1117672"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11047-019-09740-y","type":"journal-article","created":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T15:53:31Z","timestamp":1557244411000},"page":"527-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal staged self-assembly of linear assemblies"],"prefix":"10.1007","volume":"18","author":[{"given":"Cameron","family":"Chalk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Martinez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Vega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"unstructured":"Adleman L, Cheng Q, Goel A, Huang MD, Wasserman H (2001) Linear self-assemblies: equilibria, entropy and convergence rates. In: 6th international conference on difference equations and applications","key":"9740_CR1"},{"issue":"6","key":"9740_CR2","doi-asserted-by":"publisher","first-page":"2356","DOI":"10.1137\/080723971","volume":"38","author":"LM Adleman","year":"2009","unstructured":"Adleman LM, Cheng Q, Goel A, Huang MDA, Kempe D, de Espan\u00e9s PM, Rothemund PWK (2009) Combinatorial optimization problems in self-assembly. SIAM J Comput 38(6):2356\u20132381","journal-title":"SIAM J Comput"},{"issue":"15","key":"9740_CR3","doi-asserted-by":"publisher","first-page":"6054","DOI":"10.1073\/pnas.0808736106","volume":"106","author":"RD Barish","year":"2009","unstructured":"Barish RD, Schulman R, Rothemund PWK, Winfree E (2009) An information-bearing seed for nucleating algorithmic self-assembly. Proc Nat Acad Sci 106(15):6054\u20136059","journal-title":"Proc Nat Acad Sci"},{"unstructured":"Cannon S, Demaine ED, Demaine ML, Eisenstat S, Patitz MJ, Schweller RT, Summers SM, Winslow A (2013) Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM. In: STACS 2013, LIPIcs, vol 20. p 172\u2013184. Schloss Dagstuhl","key":"9740_CR4"},{"issue":"4","key":"9740_CR5","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1007\/s00453-017-0318-0","volume":"80","author":"C Chalk","year":"2018","unstructured":"Chalk C, Martinez E, Schweller R, Vega L, Winslow A, Wylie T (2018) Optimal staged self-assembly of general shapes. Algorithmica 80(4):1383\u20131409. \n                    https:\/\/doi.org\/10.1007\/s00453-017-0318-0","journal-title":"Algorithmica"},{"issue":"4","key":"9740_CR6","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1137\/110822487","volume":"41","author":"H Chandran","year":"2012","unstructured":"Chandran H, Gopalkrishnan N, Reif J (2012) Tile complexity of linear assemblies. SIAM J Comput 41(4):1051\u20131073","journal-title":"SIAM J Comput"},{"doi-asserted-by":"crossref","unstructured":"Chen HL, Doty D (2012) Parallelism and time in hierarchical self-assembly. In: 23rd annual ACM-SIAM symposium on discrete algorithms (SODA), p 1163\u20131182. SIAM","key":"9740_CR7","DOI":"10.1137\/1.9781611973099.92"},{"key":"9740_CR8","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":"9740_CR9","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 $${O}(1)$$ glues. Nat Comput 7(3):347\u2013370","journal-title":"Nat Comput"},{"issue":"2","key":"9740_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11047-012-9359-0","volume":"12","author":"ED Demaine","year":"2013","unstructured":"Demaine ED, Eisenstat S, Ishaque M, Winslow A (2013) One-dimensional staged self-assembly. Nat Comput 12(2):247\u2013258","journal-title":"Nat Comput"},{"doi-asserted-by":"crossref","unstructured":"Demaine ED, Fekete SP, Scheffer C, Schmidt A (2015) New geometric algorithms for fully connected staged self-assembly. In: Proceedings of the 21st international conference on DNA computing and molecular programming, LNCS, vol 9211. Springer, p 104\u2013116","key":"9740_CR11","DOI":"10.1007\/978-3-319-21999-8_7"},{"issue":"2","key":"9740_CR12","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/s00453-015-9976-y","volume":"74","author":"ED Demaine","year":"2016","unstructured":"Demaine ED, Patitz MJ, Rogers TA, Schweller RT, Summers SM, Woods D (2016) The two-handed tile assembly model is not intrinsically universal. Algorithmica 74(2):812\u2013850","journal-title":"Algorithmica"},{"unstructured":"Evans C (2014) Crystals that count! Physical principles and experimental investigations of dna tile self-assembly. Ph.D. thesis, Caltech","key":"9740_CR13"},{"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, p 459\u2013468","key":"9740_CR14"},{"issue":"39","key":"9740_CR15","doi-asserted-by":"publisher","first-page":"15236","DOI":"10.1073\/pnas.0701467104","volume":"104","author":"R Schulman","year":"2007","unstructured":"Schulman R, Winfree E (2007) Synthesis of crystals with a programmable kinetic barrier to nucleation. Proc Nat Acad Sci 104(39):15236\u201315241","journal-title":"Proc Nat Acad Sci"},{"doi-asserted-by":"crossref","unstructured":"Schweller R, Winslow A, Wylie T (2017) Complexities for high-temperature two-handed tile self-assembly. In: Proceedings of the 23rd international conference on DNA computing and molecular programming","key":"9740_CR16","DOI":"10.1007\/978-3-319-66799-7_7"},{"doi-asserted-by":"crossref","unstructured":"Schweller R, Winslow A, Wylie T (2017) Verification in staged tile self-assembly. In: 16th international conference unconventional computation and natural computation, p 98\u2013112","key":"9740_CR17","DOI":"10.1007\/978-3-319-58187-3_8"},{"key":"9740_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"NC Seeman","year":"1982","unstructured":"Seeman NC (1982) Nucleic-acid junctions and lattices. J Theor Biol 99:237\u2013247","journal-title":"J Theor Biol"},{"issue":"7683","key":"9740_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1038\/nature24655","volume":"552","author":"G Tikhomirov","year":"2017","unstructured":"Tikhomirov G, Petersen P, Qian L (2017) Fractal assembly of micrometre-scale dna origami arrays with arbitrary patterns. Nature 552(7683):67","journal-title":"Nature"},{"unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA. Ph.D. thesis, Caltech","key":"9740_CR20"},{"issue":"2","key":"9740_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s11047-014-9423-z","volume":"14","author":"A Winslow","year":"2015","unstructured":"Winslow A (2015) Staged self-assembly and polyomino context-free grammars. Nat Comput 14(2):293\u2013302","journal-title":"Nat Comput"},{"issue":"1","key":"9740_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11047-015-9516-3","volume":"15","author":"A Winslow","year":"2016","unstructured":"Winslow A (2016) Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems. Nat Comput 15(1):143\u2013151","journal-title":"Nat Comput"},{"key":"9740_CR23","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2014.0214","author":"D Woods","year":"2015","unstructured":"Woods D (2015) Intrinsic universality and the computational power of self-assembly. Philos Trans R Soc A. \n                    https:\/\/doi.org\/10.1098\/rsta.2014.0214","journal-title":"Philos Trans R Soc A"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09740-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-019-09740-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09740-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:23:20Z","timestamp":1589415800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-019-09740-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,6]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["9740"],"URL":"https:\/\/doi.org\/10.1007\/s11047-019-09740-y","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2019,5,6]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}