{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T20:29:18Z","timestamp":1779913758883,"version":"3.53.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T00:00:00Z","timestamp":1250640000000},"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":[[2010,3]]},"DOI":"10.1007\/s11047-009-9147-7","type":"journal-article","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T13:04:20Z","timestamp":1250600660000},"page":"135-172","source":"Crossref","is-referenced-by-count":30,"title":["Self-assembly of discrete self-similar fractals"],"prefix":"10.1007","volume":"9","author":[{"given":"Matthew J.","family":"Patitz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,8,19]]},"reference":[{"key":"9147_CR1","doi-asserted-by":"crossref","unstructured":"Adleman LM, Cheng Q, Goel A, Huang M-D, Kempe D, de Espan\u00e9s PM, Rothemund PWK (2002) Combinatorial optimization problems in self-assembly. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, pp 23\u201332","DOI":"10.1145\/509907.509913"},{"key":"9147_CR2","doi-asserted-by":"crossref","unstructured":"Adleman LM, Kari J, Kari L, Reishus D (2002) On the decidability of self-assembly of infinite ribbons. In: Proceedings of the 43rd annual IEEE symposium on foundations of computer science, pp 530\u2013537","DOI":"10.1109\/SFCS.2002.1181977"},{"key":"9147_CR3","unstructured":"Aggarwal G, Goldwasser MH, Kau M-Y, Schweller RT (2004) Complexities for generalized models of self-assembly. In: Proceedings of ACM-SIAM symposium on discrete algorithms"},{"key":"9147_CR4","doi-asserted-by":"crossref","unstructured":"Doty D, Gu X, Lutz JH, Mayordomo E, Moser P (2005) Zeta-dimension. In: Proceedings of the thirtieth international symposium on mathematical foundations of computer science, Springer-Verlag, NY, pp 283\u2013294","DOI":"10.1007\/11549345_25"},{"key":"9147_CR5","unstructured":"Graham RL, Knuth DE, Patashnik O (1994) Concrete mathematics. Addison-Wesley, Reading"},{"key":"9147_CR6","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, Florida, Jan 2006, pp 571\u2013580"},{"key":"9147_CR7","unstructured":"Kao M-Y, Schweller RT (2008) Randomized self-assembly for approximate shapes, International Colloqium on Automata, Languages, and Programming (ICALP) In: Aceto L, Damg\u00e5rd I, Goldberg LA, Halld\u00f3rsson MM, Ing\u00f3lfsd\u00f3ttir A, Walukiewicz I (eds) Lecture notes in computer science, vol 5125. Springer, Berlin, pp 370\u2013384"},{"key":"9147_CR8","doi-asserted-by":"crossref","unstructured":"Kautz SM, Lathrop JI (2009) Self-assembly of the Sierpinski carpet and related fractals. In: Proceedings of the fifteenth international meeting on DNA computing and molecular programming, Fayetteville, Arkansas, USA, 8\u201311 June 2009 (to appear)","DOI":"10.1007\/978-3-642-10604-0_8"},{"key":"9147_CR9","doi-asserted-by":"crossref","unstructured":"Lathrop JI, Lutz JH, Patitz Matthew J, Summers SM (2008) Computability and complexity in self-assembly. In: Proceedings of the fourth conference on computability in Europe Athens, Greece, 15\u201320 June 2008","DOI":"10.1007\/978-3-540-69407-6_38"},{"key":"9147_CR10","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 Comp Sci 410:384\u2013405","journal-title":"Theor Comp Sci"},{"key":"9147_CR11","unstructured":"Majumder U, LaBean TH, and Reif JH (2007) Activatable tiles for compact error-resilient directional assembly. In: Thirteenth international meeting on DNA computing (DNA 13), Memphis, Tennessee, 4\u20138 June 2007"},{"key":"9147_CR12","unstructured":"Rothemund PWK (2001) Theory and experiments in algorithmic self-assembly. Ph.D. thesis, University of Southern California, December"},{"key":"9147_CR13","unstructured":"Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract), STOC \u201900. In: Proceedings of the thirty-second annual ACM symposium on theory of computing, New York, USA, ACM, pp 459\u2013468"},{"key":"9147_CR14","doi-asserted-by":"crossref","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":"6","key":"9147_CR15","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 Comp 36(6):1544\u20131569","journal-title":"SIAM J Comp"},{"issue":"1","key":"9147_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"XL","author":"H Wang","year":"1961","unstructured":"Wang H (1961) Proving theorems by pattern recognition\u2014II. Bell Syst Tech J XL(1):1\u201341","journal-title":"Bell Syst Tech J"},{"key":"9147_CR17","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 Institute of Brooklyn, Brooklyn, NY, pp 23\u201355"},{"key":"9147_CR18","unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9147-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-009-9147-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9147-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:46:04Z","timestamp":1559346364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-009-9147-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,19]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9147"],"URL":"https:\/\/doi.org\/10.1007\/s11047-009-9147-7","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,19]]}}}