{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T09:10:08Z","timestamp":1740215408487,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642139611"},{"type":"electronic","value":"9783642139628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13962-8_32","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T12:33:57Z","timestamp":1277555637000},"page":"286-295","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Self-assembly of the Sierpinski Triangle"],"prefix":"10.1007","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]},{"given":"Brad","family":"Shutters","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Bondarenko, B.A.: Generalized Pascal Triangles and Pyramids, Their Fractals, Graphs and Applications. The Fibonacci Association (1993)","DOI":"10.1080\/00150517.1993.12429308"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Doty, D., Gu, X., Lutz, J.H., Mayordomo, E., Moser, P.: Zeta-dimension. In: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (2005)","DOI":"10.1007\/11549345_25"},{"key":"32_CR3","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1994)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Kautz, S.M., Lathrop, J.I.: Self-assembly of the Sierpinski carpet and related fractals. In: Proceedings of the 15th International Meeting on DNA Computing and Molecular Programming (2009)","DOI":"10.1007\/978-3-642-10604-0_8"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"J.I. Lathrop","year":"2009","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theoretical Computer Science\u00a0410, 384\u2013405 (2009)","journal-title":"Theoretical Computer Science"},{"key":"32_CR6","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of discrete self-similar fractals. Natural Computing (to appear)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology\u00a02(12) (2004)","DOI":"10.1371\/journal.pbio.0020424"},{"key":"32_CR8","unstructured":"Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-Assembly. Ph.D. thesis, University of Southern California, Los Angeles, California (2001)"},{"key":"32_CR9","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":"32_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1038\/nature01406","volume":"421","author":"N.C. Seeman","year":"2003","unstructured":"Seeman, N.C.: DNA in a material world. Nature\u00a0421, 427\u2013431 (2003)","journal-title":"Nature"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D. Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal on Computing\u00a036, 1544\u20131569 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR12","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology, Pasadena, California (1998)"}],"container-title":["Lecture Notes in Computer Science","Programs, Proofs, Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13962-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T08:23:48Z","timestamp":1740212628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13962-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139611","9783642139628"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13962-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}