{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:26:36Z","timestamp":1725895596005},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106033"},{"type":"electronic","value":"9783642106040"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10604-0_8","type":"book-chapter","created":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T15:25:00Z","timestamp":1257866700000},"page":"78-87","source":"Crossref","is-referenced-by-count":14,"title":["Self-assembly of the Discrete Sierpinski Carpet and Related Fractals"],"prefix":"10.1007","author":[{"given":"Steven M.","family":"Kautz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James I.","family":"Lathrop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-69407-6_38","volume-title":"Logic and Theory of Algorithms","author":"J.I. Lathrop","year":"2008","unstructured":"Lathrop, J.I., Lutz, J.H., Patitz, M.J., Summers, S.M.: Computability and complexity in self-assembly. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 349\u2013358. Springer, Heidelberg (2008)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-540-73001-9_47","volume-title":"Computation and Logic in the Real World","author":"J.I. Lathrop","year":"2007","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497, pp. 455\u2013464. Springer, Heidelberg (2007)"},{"key":"8_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/b97624","volume-title":"Chaos and fractals: New frontiers of science","author":"H.O. Peitgen","year":"2004","unstructured":"Peitgen, H.O., J\u00fcrgens, H., Saupe, D.: Chaos and fractals: New frontiers of science. Springer, Heidelberg (2004)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Papadakis, N., Rothemund, P., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biology\u00a012 (2004)","DOI":"10.1371\/journal.pbio.0020424"},{"key":"8_CR5","unstructured":"Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly. Ph.D. thesis, University of Southern California (December 2001)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"8_CR7","unstructured":"N.J. A Sloane, The on-line encyclopedia of integer sequences, [Online; accessed 09-January-2008] (2008)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Wang, H.: Proving theorems by pattern recognition \u2013 II. The Bell System Technical Journal XL(1), 1\u201341 (1961)","DOI":"10.1007\/978-94-009-2356-0_9"},{"key":"8_CR9","first-page":"23","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata","author":"H. Wang","year":"1963","unstructured":"Wang, H.: Dominoes and the AEA case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata, New York, pp. 23\u201355. Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn (1962\/1963)"},{"key":"8_CR10","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology (June 1998)"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10604-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:31:39Z","timestamp":1606185099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10604-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106033","9783642106040"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10604-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}