{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:47:31Z","timestamp":1756000051304},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_47","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"455-464","source":"Crossref","is-referenced-by-count":12,"title":["Strict Self-assembly of Discrete Sierpinski Triangles"],"prefix":"10.1007","author":[{"given":"James I.","family":"Lathrop","sequence":"first","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Adleman, L.: Towards a mathematical theory of self-assembly, Tech. report (1999)"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.-D. A., Kempe, D., de Espan\u00e9s, P. M., Rothemund, P. W. K.: Combinatorial optimization problems in self-assembly, pp. 23\u201332 (2002)","DOI":"10.1145\/509909.509913"},{"key":"47_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0470013850","volume-title":"Fractal geometry: Mathematical foundations and applications","author":"K. Falconer","year":"2003","unstructured":"Falconer, K.: Fractal geometry: Mathematical foundations and applications, 2nd edn. Wiley, Chichester (2003)","edition":"2"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Molecular assembly and computation: From theory to experimental demonstrations, International Colloquium on Automata, Languages and Programming, pp.\u00a01\u201321 (2002)","DOI":"10.1007\/3-540-45465-9_1"},{"key":"47_CR5","unstructured":"Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). STOC, pp.\u00a0459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles, PLoS Biology 2(12) (2004)","DOI":"10.1371\/journal.pbio.0020424"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"N.C. Seeman","year":"1982","unstructured":"Seeman, N.C.: Nucleic-acid junctions and lattices. Journal of Theoretical Biology\u00a099, 237\u2013247 (1982)","journal-title":"Journal of Theoretical Biology"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Soloveichik, D., Winfree, E.: Complexity of compact proofreading for self-assembled patterns, The Eleventh International Meeting on DNA Computing (2005)","DOI":"10.1007\/11753681_24"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11493785_30","volume-title":"DNA Computing","author":"D. Soloveichik","year":"2005","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA Computing. LNCS, vol.\u00a03384, Springer, Heidelberg (2005)"},{"issue":"1","key":"47_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"XL","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition \u2013 II. The Bell System Technical Journal\u00a0XL(1), 1\u201341 (1961)","journal-title":"The Bell System Technical Journal"},{"key":"47_CR12","unstructured":"Wang, H.: 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, N.Y., pp.\u00a023\u201355 (1963)"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0167-2789(84)90250-1","volume":"10","author":"S.J. Willson","year":"1984","unstructured":"Willson, S.J.: Growth rates and fractional dimensions in cellular automata. Physica D\u00a010, 69\u201374 (1984)","journal-title":"Physica D"},{"key":"47_CR14","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology, June (1998)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T08:18:26Z","timestamp":1556698706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}