{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:00:08Z","timestamp":1768071608766,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030000295","type":"print"},{"value":"9783030000301","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00030-1_6","type":"book-chapter","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T19:44:00Z","timestamp":1536263040000},"page":"87-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hierarchical Growth Is Necessary and\u00a0(Sometimes) Sufficient to\u00a0Self-assemble Discrete Self-similar Fractals"],"prefix":"10.1007","author":[{"given":"Jacob","family":"Hendricks","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Opseth","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,7]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-08123-6_3","volume-title":"Unconventional Computation and Natural Computation","author":"K Barth","year":"2014","unstructured":"Barth, K., Furcy, D., Summers, S.M., Totzke, P.: Scaled tree fractals do not strictly self-assemble. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol. 8553, pp. 27\u201339. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08123-6_3"},{"key":"6_CR2","unstructured":"Cannon, S., et al.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: Portier, N., Wilke, T. (eds.) STACS. LIPIcs, vol. 20, pp. 172\u2013184. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"6_CR3","first-page":"1","volume":"76","author":"CT Chalk","year":"2015","unstructured":"Chalk, C.T., Fernandez, D.A., Huerta, A., Maldonado, M.A., Schweller, R.T., Sweet, L.: Strict self-assembly of fractals using multiple hands. Algorithmica 76, 1\u201330 (2015)","journal-title":"Algorithmica"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/1.9781611973099.92","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Ho-Lin Chen","year":"2012","unstructured":"Chen, H.-L., Doty, D.: Parallelism and time in hierarchical self-assembly. In: SODA 2012: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1163\u20131182. SIAM (2012)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704446037","volume":"34","author":"Q Cheng","year":"2005","unstructured":"Cheng, Q., Aggarwal, G., Goldwasser, M.H., Kao, M.-Y., Schweller, R.T., de Espan\u00e9s, P.M.: Complexities for generalized models of self-assembly. SIAM J. Comput. 34, 1493\u20131515 (2005)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1021\/nl0722830","volume":"8","author":"K Fujibayashi","year":"2007","unstructured":"Fujibayashi, K., Hariadi, R., Park, S.H., Winfree, E., Murata, S.: Toward reliable algorithmic self-assembly of DNA tiles: a fixed-width cellular automaton pattern. Nano Lett. 8(7), 1791\u20131797 (2007)","journal-title":"Nano Lett."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Hendricks, J., Olsen, M., Patitz, M.J., Rogers, T.A., Thomas, H.: Hierarchical self-assembly of fractals with signal-passing tiles (extended abstract). In: Proceedings of the 22nd International Conference on DNA Computing and Molecular Programming (DNA 22), Munich, Germany, 4\u20138 September 2016, pp. 82\u201397. Ludwig-Maximilians-Universitt (2016)","DOI":"10.1007\/978-3-319-43994-5_6"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-58187-3_9","volume-title":"Unconventional Computation and Natural Computation","author":"J Hendricks","year":"2017","unstructured":"Hendricks, J., Opseth, J.: Self-assembly of 4-sided fractals in the two-handed tile assembly model. In: Patitz, M.J., Stannett, M. (eds.) UCNC 2017. LNCS, vol. 10240, pp. 113\u2013128. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58187-3_9"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Hendricks, J., Opseth, J., Patitz, MJ., Summers, S.M.: Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals. Technical report 1807.04831, Computing Research Repository (2018)","DOI":"10.1007\/978-3-030-00030-1_6"},{"issue":"02","key":"6_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1142\/S0129054114500087","volume":"25","author":"N Jonoska","year":"2014","unstructured":"Jonoska, N., Karpenko, D.: Active tile self-assembly, part 1: universality at temperature 1. Int. J. Found. Comput. Sci. 25(02), 141\u2013163 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"02","key":"6_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1142\/S0129054114500099","volume":"25","author":"N Jonoska","year":"2014","unstructured":"Jonoska, N., Karpenko, D.: Active tile self-assembly, part 2: self-similar structures and structural recursion. Int. J. Found. Comput. Sci. 25(02), 165\u2013194 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00453-012-9691-x","volume":"67","author":"S Kautz","year":"2013","unstructured":"Kautz, S., Shutters, B.: Self-assembling rulers for approximating generalized Sierpinski carpets. Algorithmica 67(2), 207\u2013233 (2013)","journal-title":"Algorithmica"},{"key":"6_CR13","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":"SM 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 2009. LNCS, vol. 5877, pp. 78\u201387. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10604-0_8"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"JI Lathrop","year":"2009","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theor. Comput. Sci. 410, 384\u2013405 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-03076-5_10","volume-title":"DNA Computing","author":"C Luhrs","year":"2009","unstructured":"Luhrs, C.: Polyomino-safe DNA self-assembly via block replacement. In: Goel, A., Simmel, F.C., Sos\u00edk, P. (eds.) DNA 2008. LNCS, vol. 5347, pp. 112\u2013126. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03076-5_10"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s00224-011-9345-4","volume":"51","author":"JH Lutz","year":"2012","unstructured":"Lutz, J.H., Shutters, B.: Approximate self-assembly of the Sierpinski triangle. Theory Comput. Syst. 51(3), 372\u2013400 (2012)","journal-title":"Theory Comput. Syst."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-43994-5_7","volume-title":"DNA Computing and Molecular Programming","author":"MJ Patitz","year":"2016","unstructured":"Patitz, M.J., Rogers, T.A., Schweller, R.T., Summers, S.M., Winslow, A.: Resiliency to multiple nucleation in temperature-1 self-assembly. In: Rondelez, Y., Woods, D. (eds.) DNA 2016. LNCS, vol. 9818, pp. 98\u2013113. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43994-5_7"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11047-009-9147-7","volume":"1","author":"MJ Patitz","year":"2010","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of discrete self-similar fractals. Nat. Comput. 1, 135\u2013172 (2010)","journal-title":"Nat. Comput."},{"issue":"12","key":"6_CR19","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"PW Rothemund","year":"2004","unstructured":"Rothemund, P.W., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol. 2(12), 2041\u20132053 (2004)","journal-title":"PLoS Biol."},{"key":"6_CR20","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology, June 1998"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00030-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:42:47Z","timestamp":1709833367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00030-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030000295","9783030000301"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00030-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on DNA Computing and Molecular Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dna24sdnu.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}