{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:14:51Z","timestamp":1648887291286},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,3,28]],"date-time":"2012-03-28T00:00:00Z","timestamp":1332892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s11047-012-9321-1","type":"journal-article","created":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T05:25:31Z","timestamp":1332825931000},"page":"535-550","source":"Crossref","is-referenced-by-count":5,"title":["Step-wise tile assembly with a constant number of tile types"],"prefix":"10.1007","volume":"11","author":[{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladislav","family":"Stacho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Stoll","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,28]]},"reference":[{"key":"9321_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/332833.332842","volume":"43","author":"H Abelson","year":"2000","unstructured":"Abelson H, Allen D, Coore D, Hanson C, Homsy G, Knight TF, Nagpal R, Rauch E, Sussman GJ, Weiss R (2000) Amorphous computing. Commun ACM 43:74\u201382","journal-title":"Commun ACM"},{"key":"9321_CR2","doi-asserted-by":"crossref","unstructured":"Adleman L, Cheng Q, Goel A, Huang M-D, Kempe D, de Espanes PM, Rothemund P (2002) Combinatorial optimization problems in self-assembly. In: Proceedings of STOC, Montreal, Canada, pp 23\u201332","DOI":"10.1145\/509907.509913"},{"issue":"6","key":"9321_CR3","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal G, Cheng Q, Goldwasser MH, Kao M-Y, Espanes PM, Schweller RT (2005) Complexities for generalized models of self-assembly. SIAM J Comput 34(6):1493\u20131515","journal-title":"SIAM J Comput"},{"key":"9321_CR4","unstructured":"Barriere L, Fraigniaud P, Santoro N, Thilikos DM (2003) Connected and internal graph searching. In: 29th workshop on graph theoretic concepts in computer science (WG). LNCS, vol 2880. Springer, Heidelberg, pp 34\u201345"},{"key":"9321_CR5","unstructured":"Best MJ A bound on connected pathwidth. Manuscript"},{"issue":"3","key":"9321_CR6","doi-asserted-by":"crossref","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":"12","key":"9321_CR7","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1016\/j.ic.2008.09.002","volume":"206","author":"P Fraigniaud","year":"2008","unstructured":"Fraigniaud P, Nisse N (2008) Monotony properties of connected visible graph searching. Inf Comput 206(12):1383\u20131393","journal-title":"Inf Comput"},{"key":"9321_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1088\/0957-4484\/7\/3\/004","volume":"7","author":"M Gomez-Lopez","year":"1996","unstructured":"Gomez-Lopez M, Preece J, Stoddart J (1996) The art and science of self-assembling molecular machines. Nanotechnology 7:183\u2013192","journal-title":"Nanotechnology"},{"issue":"1","key":"9321_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"LM Kirousis","year":"1985","unstructured":"Kirousis LM, Papadimitriou CH (1985) Interval graphs and searching. Discr Math 55(1):181\u2013184","journal-title":"Discr Math"},{"issue":"2","key":"9321_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L Kirousis","year":"1986","unstructured":"Kirousis L, Papadimitriou C (1986) Searching and pebbling. Theor Comput Sci 47(2):205\u2013218","journal-title":"Theor Comput Sci"},{"key":"9321_CR11","doi-asserted-by":"crossref","first-page":"1848","DOI":"10.1021\/ja993393e","volume":"122","author":"T LaBean","year":"2000","unstructured":"LaBean T, Yan H, Kopatsch J, Liu F, Winfree E, Reif JH, Seeman N (2000) Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes. J Am Chem Soc 122:1848\u20131860","journal-title":"J Am Chem Soc"},{"key":"9321_CR13","doi-asserted-by":"crossref","unstructured":"Ma\u0148uch J, Stacho L, Stoll C (2009) Step-assembly with a constant number of tile types. In: Proceedings of the 20th international symposium on algorithms and computation (ISAAC, Hawaii, 2009), number 5878 in LNCS, pp 954\u2013963","DOI":"10.1007\/978-3-642-10631-6_96"},{"key":"9321_CR12","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1038\/35035038","volume":"407","author":"C Mao","year":"2000","unstructured":"Mao C, LaBean TH, Reif J, Seeman N (2000) Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407:493\u2013496","journal-title":"Nature"},{"key":"9321_CR14","unstructured":"Reif JH (1999) Local parallel biomolecular computing. In: DNA based computers III, vol 48 of DIMACS. American Mathematical Society, Providence, pp 217\u2013254"},{"key":"9321_CR16","unstructured":"Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares. In: Proceedings of STOC, New York, pp 459\u2013468"},{"key":"9321_CR15","doi-asserted-by":"crossref","first-page":"2041","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"P Rothemund","year":"2004","unstructured":"Rothemund P, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol 2:2041\u20132053","journal-title":"PLoS Biol"},{"key":"9321_CR17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1146\/annurev.biophys.27.1.225","volume":"27","author":"N Seeman","year":"1998","unstructured":"Seeman N (1998) DNA nanotechnology: novel DNA constructions. Annu Rev Biophys Biomol Struct 27:225\u2013248","journal-title":"Annu Rev Biophys Biomol Struct"},{"key":"9321_CR18","doi-asserted-by":"crossref","unstructured":"Summers SM (2012) Reducing tile complexity for the self-assembly of scaled shapes through temperature programming. Algorithmica 63(1\u20132):117\u2013136","DOI":"10.1007\/s00453-011-9522-5"},{"key":"9321_CR20","unstructured":"Winfree E, Yang X, Seeman N (1996) Universal computation via self-assembly of DNA: some theory and experiments. In: Proceedings of the second annual meeting on DNA based computers, pp 191\u2013214"},{"key":"9321_CR19","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E Winfree","year":"1998","unstructured":"Winfree E, Liu F, Wenzler LA, Seeman NC (1998) Design and self-assembly of two dimensional DNA crystals. Nature 394:539\u2013544","journal-title":"Nature"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-012-9321-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-012-9321-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-012-9321-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T03:53:45Z","timestamp":1561521225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-012-9321-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,28]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9321"],"URL":"https:\/\/doi.org\/10.1007\/s11047-012-9321-1","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,28]]}}}