{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T18:29:14Z","timestamp":1768069754686,"version":"3.49.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319081229","type":"print"},{"value":"9783319081236","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08123-6_3","type":"book-chapter","created":{"date-parts":[[2014,7,7]],"date-time":"2014-07-07T13:08:12Z","timestamp":1404738492000},"page":"27-39","source":"Crossref","is-referenced-by-count":12,"title":["Scaled Tree Fractals Do not Strictly Self-assemble"],"prefix":"10.1007","author":[{"given":"Kimberly","family":"Barth","sequence":"first","affiliation":[]},{"given":"David","family":"Furcy","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Totzke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-10604-0_8","volume-title":"DNA Computing and Molecular Programming","author":"S.M. Kautz","year":"2009","unstructured":"Kautz, S.M., Lathrop, J.I.: Self-assembly of the discrete Sierpinski carpet and related fractals. In: Deaton, R., Suyama, A. (eds.) DNA 15. LNCS, vol.\u00a05877, pp. 78\u201387. Springer, Heidelberg (2009)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00453-012-9691-x","volume":"67","author":"S.M. Kautz","year":"2013","unstructured":"Kautz, S.M., Shutters, B.: Self-assembling rulers for approximating generalized sierpinski carpets. Algorithmica\u00a067(2), 207\u2013233 (2013)","journal-title":"Algorithmica"},{"key":"3_CR3","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"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s00224-011-9345-4","volume":"51","author":"J.H. Lutz","year":"2012","unstructured":"Lutz, J.H., Shutters, B.: Approximate self-assembly of the sierpinski triangle. Theory Comput. Syst.\u00a051(3), 372\u2013400 (2012)","journal-title":"Theory Comput. Syst."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Meunier, P.-E., Patitz, M.J., Summers, S.M., Theyssier, G., Winslow, A., Woods, D.: Intrinsic universality in tile self-assembly requires cooperation. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 752\u2013771 (2014)","DOI":"10.1137\/1.9781611973402.56"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11047-009-9147-7","volume":"1","author":"M.J. Patitz","year":"2010","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of discrete self-similar fractals. Natural Computing\u00a01, 135\u2013172 (2010)","journal-title":"Natural Computing"},{"key":"3_CR7","unstructured":"Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)"},{"key":"3_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":"3_CR9","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1080\/07391102.1990.10507829","volume":"8","author":"N.C. Seeman","year":"1990","unstructured":"Seeman, N.C.: De novo design of sequences for nucleic acid structural engineering. Journal of Biomolecular Structural Dynamics\u00a08, 573\u2013581 (1990)","journal-title":"Journal of Biomolecular Structural Dynamics"},{"key":"3_CR10","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.1002\/j.1538-7305.1961.tb03975.x"},{"key":"3_CR11","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology (June 1998)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08123-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T08:45:58Z","timestamp":1720773958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08123-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319081229","9783319081236"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08123-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}