{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:52:26Z","timestamp":1649177546301},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,3,28]],"date-time":"2008-03-28T00:00:00Z","timestamp":1206662400000},"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":[[2008,9]]},"DOI":"10.1007\/s11047-008-9070-3","type":"journal-article","created":{"date-parts":[[2008,3,27]],"date-time":"2008-03-27T06:31:09Z","timestamp":1206599469000},"page":"317-334","source":"Crossref","is-referenced-by-count":4,"title":["Toward minimum size self-assembled counters"],"prefix":"10.1007","volume":"7","author":[{"given":"Pablo","family":"Moisset de Espan\u00e9s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Goel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,28]]},"reference":[{"key":"9070_CR1","doi-asserted-by":"crossref","unstructured":"Adleman L, Cheng Q, Goel A, Huang M (2001) Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on theory of computing. ACM Press, pp 740\u2013748","DOI":"10.1145\/380752.380881"},{"key":"9070_CR2","doi-asserted-by":"crossref","unstructured":"Adleman L, Cheng Q, Goel A, Huang M, Kempe D, Moisset de Espan\u00e9s P, Rothemund P (2002) Combinatorial optimization problems in self-assembly. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing. ACM Press, pp 23\u201332","DOI":"10.1145\/509907.509913"},{"key":"9070_CR3","unstructured":"Aggarwal G, Goldwasser M, Kao M, Schweller RT (2004) Complexities for generalized models of self-assembly. In: Proceedings of symposium on discrete algorithms. ACM Press"},{"key":"9070_CR4","unstructured":"Chen H, Cheng Q, Goel A, Moisset de Espan\u00e9s P (2004) Invadable self-assembly, combining robustness with efficiency. In: Proceedings of symposium on discrete algorithms. ACM Press"},{"key":"9070_CR5","unstructured":"Cheng Q, Moisset P (2003) Resolving two open problems in the self-assembly of squares. Technical Report 03-793, University of Southern California"},{"key":"9070_CR6","unstructured":"Cheng Q, Goel A, Moisset de Espan\u00e9s P (2004) Optimal self-assembly of counters at temperature two. In: Foundation of Nanoscience"},{"key":"9070_CR7","doi-asserted-by":"crossref","unstructured":"Cook M, Rothemund P, Winfree E (2003) Self assembled circuit patterns. In: Proceedings of DNA computing. Springer-Verlag","DOI":"10.1007\/978-3-540-24628-2_11"},{"key":"9070_CR9","unstructured":"Goel A, Moisset de Espan\u00e9s P (2007) Toward minimum size self-assembled counters. In: Proceedings of the 13th international meeting on DNA computing. Springer Verlag"},{"key":"9070_CR10","doi-asserted-by":"crossref","unstructured":"Kao M, Schweller R (2006) Reducing tile complexity for self-assembly through temperature programming","DOI":"10.1145\/1109557.1109620"},{"key":"9070_CR8","unstructured":"Moisset de Espan\u00e9s P (2005) Computerized exhaustive search for optimal self-assembly counters. In: FNANO05: Proccedings of the 2nd annual foundations of nanoscience conference, pp 24\u201325"},{"key":"9070_CR13","unstructured":"Rothemund P (2001) Theory and experiments in algorithmic self-assembly. PhD thesis, University of Southern California"},{"key":"9070_CR14","doi-asserted-by":"crossref","unstructured":"Rothemund PWK (2005) Design of DNA origami. In: ICCAD \u201905: Proceedings of the 2005 IEEE\/ACM international conference on computer-aided design. IEEE Computer Society, Washington, pp. 471\u2013478","DOI":"10.1109\/ICCAD.2005.1560114"},{"key":"9070_CR11","doi-asserted-by":"crossref","unstructured":"Rothemund P, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the thirty-second annual ACM symposium on theory of computing. ACM Press, pp 459\u2013468","DOI":"10.1145\/335305.335358"},{"key":"9070_CR12","doi-asserted-by":"crossref","unstructured":"Rothemund PW, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA sierpinski triangles. PLoS Biol 2(12):e424","DOI":"10.1371\/journal.pbio.0020424"},{"key":"9070_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H Wang","year":"1961","unstructured":"Wang H (1961) Proving theorems by pattern recognition ii. Bell Syst Tech J 40:1\u201342","journal-title":"Bell Syst Tech J"},{"key":"9070_CR19","unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology, Pasadena"},{"key":"9070_CR16","unstructured":"Winfree E, Bekbolatov R (2003) Proofreading tile sets: error correction for algorithmic self-assembly. In DNA, pp 126\u2013144"},{"key":"9070_CR17","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. Princeton University"},{"key":"9070_CR18","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E Winfree","year":"1998","unstructured":"Winfree E, Liu F, Wenzler L, Seeman N (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394:539\u2013544","journal-title":"Nature"},{"key":"9070_CR20","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1038\/35020524","volume":"406","author":"B Yurke","year":"2000","unstructured":"Yurke B, Turberfield A, Mills Jr A, Simmel F, Neumann J (2000) A DNA-fuelled molecular machine made of DNA. Nature 406:605\u2013608","journal-title":"Nature"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-008-9070-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-008-9070-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-008-9070-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:46:03Z","timestamp":1559346363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-008-9070-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,28]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9070"],"URL":"https:\/\/doi.org\/10.1007\/s11047-008-9070-3","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,28]]}}}