{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:48:27Z","timestamp":1770065307713,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T00:00:00Z","timestamp":1284422400000},"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":[[2011,6]]},"DOI":"10.1007\/s11047-010-9218-9","type":"journal-article","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T05:41:49Z","timestamp":1284356509000},"page":"853-877","source":"Crossref","is-referenced-by-count":23,"title":["Self-assembly of decidable sets"],"prefix":"10.1007","volume":"10","author":[{"given":"Matthew J.","family":"Patitz","sequence":"first","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,14]]},"reference":[{"key":"9218_CR1","doi-asserted-by":"crossref","unstructured":"Adleman L, Cheng Q, Goel A, Huang M-D (2001) Running time and program size for self-assembled squares. In: STOC \u201901: proceedings of the thirty-third annual ACM symposium on theory of computing. ACM, New York, pp 740\u2013748","DOI":"10.1145\/380752.380881"},{"issue":"6","key":"9218_CR2","doi-asserted-by":"crossref","first-page":"2356","DOI":"10.1137\/080723971","volume":"38","author":"LM Adleman","year":"2009","unstructured":"Adleman LM, Kari J, Kari L, Reishus D, Sos\u00edk P (2009) The undecidability of the infinite ribbon problem: implications for computing by self-assembly. SIAM J Comput 38(6):2356\u20132381","journal-title":"SIAM J Comput"},{"issue":"15","key":"9218_CR3","doi-asserted-by":"crossref","first-page":"6054","DOI":"10.1073\/pnas.0808736106","volume":"106","author":"RD Barish","year":"2009","unstructured":"Barish RD, Schulman R, Rothemund PW, Winfree E (2009) An information-bearing seed for nucleating algorithmic self-assembly. Proc Natl Acad Sci USA 106(15):6054\u20136059","journal-title":"Proc Natl Acad Sci USA"},{"key":"9218_CR4","unstructured":"Becker F, Rapaport I, R\u00e9mila E (2006) Self-assembling classes of shapes with a minimum number of tiles, and in optimal time. In: Foundations of software technology and theoretical computer science (FSTTCS), pp 45\u201356"},{"key":"9218_CR6","unstructured":"Cheng Q, Goel A, de Espan\u00e9s PM (2004) Optimal self-assembly of counters at temperature two. In: Proceedings of the first conference on foundations of nanoscience: self-assembled architectures and devices"},{"key":"9218_CR5","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"Q Cheng","year":"2005","unstructured":"Cheng Q, Aggarwal G, Goldwasser MH, Kao M-Y, 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":"9218_CR7","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"},{"key":"9218_CR8","doi-asserted-by":"crossref","unstructured":"Doty D (2009) Randomized self-assembly for exact shapes. In: Proceedings of the fiftieth IEEE conference on foundations of computer science (FOCS)","DOI":"10.1109\/FOCS.2009.13"},{"key":"9218_CR9","doi-asserted-by":"crossref","unstructured":"Doty D, Patitz MJ (2009) A domain specific language for programming in the tile assembly model. In: Proceedings of the fifteenth international meeting on DNA computing and molecular programming, Fayetteville, Arkansas, USA, June 8\u201311, 2009, pp 25\u201334","DOI":"10.1007\/978-3-642-10604-0_3"},{"key":"9218_CR10","doi-asserted-by":"crossref","unstructured":"Doty D, Patitz MJ, Summers SM Limitations of self-assembly at temperature 1. Theor Comput Sci (to appear)","DOI":"10.4204\/EPTCS.1.6"},{"key":"9218_CR11","unstructured":"Fu Y, Schweller R (2009) Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. Technical report 0912.0027, Computing Research Repository"},{"key":"9218_CR12","unstructured":"Kao M-Y, Schweller RT (2007) Reducing tile complexity for self-assembly through temperature programming. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA 2006), Miami, FL, January 2006, pp 571\u2013580"},{"key":"9218_CR13","unstructured":"Kao M-Y, Schweller RT (2008) Randomized self-assembly for approximate shapes. In: International colloqium on automata, languages, and programming (ICALP). Lecture notes in computer science, vol 5125. Springer, pp 370\u2013384"},{"key":"9218_CR15","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"JI Lathrop","year":"2009","unstructured":"Lathrop JI, Lutz JH, Summers SM (2009) Strict self-assembly of discrete Sierpinski triangles. Theor Comput Sci 410:384\u2013405","journal-title":"Theor Comput Sci"},{"key":"9218_CR14","unstructured":"Lathrop JI, Lutz JH, Patitz MJ, Summers SM Computability and complexity in self-assembly. Theory Comput Syst (to appear)"},{"key":"9218_CR16","unstructured":"Patitz MJ (2009) Simulation of self-assembly in the abstract tile assembly model with ISU TAS. In: 6th Annual conference on foundations of nanoscience: self-assembled architectures and devices, Snowbird, UT, USA, 20\u201324 April 2009"},{"key":"9218_CR17","unstructured":"Reif JH (1999) Local parallel biomolecular computing. DNA based computers III, vol 48 of DIMACS. American Mathematical Society, pp 217\u2013254"},{"key":"9218_CR18","unstructured":"Rothemund PWK (2001) Theory and experiments in algorithmic self-assembly. Ph.D. thesis, University of Southern California"},{"key":"9218_CR19","unstructured":"Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: STOC \u201900: Proceedings of the thirty-second annual ACM symposium on theory of computing, New York, NY, USA. ACM, pp 459\u2013468"},{"key":"9218_CR20","doi-asserted-by":"crossref","unstructured":"Rothemund PWK, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol 2(12):2041\u20132053","DOI":"10.1371\/journal.pbio.0020424"},{"issue":"6","key":"9218_CR21","doi-asserted-by":"crossref","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"},{"key":"9218_CR22","doi-asserted-by":"crossref","unstructured":"Wang H (1961) Proving theorems by pattern recognition\u2014II. Bell Syst Tech J XL(1):1\u201341","DOI":"10.1007\/978-94-009-2356-0_9"},{"key":"9218_CR23","unstructured":"Wang H (1963) Dominoes and the AEA case of the decision problem. In: Proceedings of the symposium on mathematical theory of automata, New York, 1962. Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn, pp 23\u201355"},{"key":"9218_CR24","unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-010-9218-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-010-9218-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-010-9218-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T16:48:53Z","timestamp":1559666933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-010-9218-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,14]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9218"],"URL":"https:\/\/doi.org\/10.1007\/s11047-010-9218-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,14]]}}}