{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:21:14Z","timestamp":1769829674717,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031340338","type":"print"},{"value":"9783031340345","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34034-5_11","type":"book-chapter","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T17:02:06Z","timestamp":1685552526000},"page":"155-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Simulation of\u00a0Multiple Stages in\u00a0Single Bin Active Tile Self-assembly"],"prefix":"10.1007","author":[{"given":"Sonya C.","family":"Cirlos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"Gomez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elise","family":"Grizzell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,1]]},"reference":[{"key":"11_CR1","unstructured":"Alaniz, R.M., et al.: Building squares with optimal state complexity in restricted active self-assembly. In: Proceedings of the Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, vol. 221, pp. 6:1\u20136:18 (2022)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-030-26807-7_8","volume-title":"DNA Computing and Molecular Programming","author":"JC Alumbaugh","year":"2019","unstructured":"Alumbaugh, J.C., Daymude, J.J., Demaine, E.D., Patitz, M.J., Richa, A.W.: Simulation of programmable matter systems using active tile-based self-assembly. In: Thachuk, C., Liu, Y. (eds.) DNA 2019. LNCS, vol. 11648, pp. 140\u2013158. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26807-7_8"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1918","DOI":"10.1016\/j.procs.2019.09.364","volume":"159","author":"G Barad","year":"2019","unstructured":"Barad, G., et al.: Simulation of one dimensional staged dna tile assembly by the signal-passing hierarchical tam. Procedia Comput. Sci. 159, 1918\u20131927 (2019)","journal-title":"Procedia Comput. Sci."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Benz, F., K\u00f6tzing, T.: An effective heuristic for the smallest grammar problem. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 487\u2013494 (2013)","DOI":"10.1145\/2463372.2463441"},{"key":"11_CR5","unstructured":"Caballero, D., Gomez, T., Schweller, R., Wylie, T.: Verification and computation in restricted tile automata. In: 26th International Conference on DNA Computing and Molecular Programming, DNA 2020, vol. 174, pp. 10:1\u201310:18 (2020)"},{"key":"11_CR6","unstructured":"Caballero, D., Gomez, T., Schweller, R., Wylie, T.: Covert computation in staged self-assembly: verification is pspace-complete. In: 29th Annual European Symposium on Algorithms, ESA 2021, pp. 23:1\u201323:18 (2021)"},{"key":"11_CR7","unstructured":"Cannon, S., et al.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: 30th Inter. Sym. on Theoretical Aspects of Computer Science, STACS 2013, vol. 20, pp. 172\u2013184 (2013)"},{"key":"11_CR8","unstructured":"Cantu, A.A., Luchsinger, A., Schweller, R., Wylie, T.: Signal passing self-assembly simulates tile automata. In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, pp. 53:1\u201353:17 (2020)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-00030-1_10","volume-title":"DNA Computing and Molecular Programming","author":"C Chalk","year":"2018","unstructured":"Chalk, C., Luchsinger, A., Martinez, E., Schweller, R., Winslow, A., Wylie, T.: Freezing simulates non-freezing tile automata. In: Doty, D., Dietz, H. (eds.) DNA 2018. LNCS, vol. 11145, pp. 155\u2013172. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00030-1_10"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1007\/s00453-017-0318-0","volume":"80","author":"C Chalk","year":"2018","unstructured":"Chalk, C., Martinez, E., Schweller, R., Vega, L., Winslow, A., Wylie, T.: Optimal staged self-assembly of general shapes. Algorithmica 80(4), 1383\u20131409 (2018)","journal-title":"Algorithmica"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s11047-019-09740-y","volume":"18","author":"C Chalk","year":"2019","unstructured":"Chalk, C., Martinez, E., Schweller, R., Vega, L., Winslow, A., Wylie, T.: Optimal staged self-assembly of linear assemblies. Nat. Comput. 18(3), 527\u2013548 (2019). https:\/\/doi.org\/10.1007\/s11047-019-09740-y","journal-title":"Nat. Comput."},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., et al.: Staged self-assembly: nanomanufacture of arbitrary shapes with o (1) glues. Nat. Comput. 7(3), 347\u2013370 (2008)","journal-title":"Nat. Comput."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Eisenstat, S., Ishaque, M., Winslow, A.: One-dimensional staged self-assembly. In: Proceedings of the 17th International Conference on DNA Computing and Molecular Programming, DNA 2011, pp. 100\u2013114 (2011)","DOI":"10.1007\/978-3-642-23638-9_10"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11047-018-9701-2","volume":"18","author":"R Schweller","year":"2019","unstructured":"Schweller, R., Winslow, A., Wylie, T.: Verification in staged tile self-assembly. Nat. Comput. 18(1), 107\u2013117 (2019)","journal-title":"Nat. Comput."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Thubagere, A.J., et al.: A cargo-sorting DNA robot. Science 357(6356), eaan6558 (2017)","DOI":"10.1126\/science.aan6558"},{"issue":"7683","key":"11_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1038\/nature24655","volume":"552","author":"G Tikhomirov","year":"2017","unstructured":"Tikhomirov, G., Petersen, P., Qian, L.: Fractal assembly of micrometre-scale dna origami arrays with arbitrary patterns. Nature 552(7683), 67\u201371 (2017)","journal-title":"Nature"},{"key":"11_CR17","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology (June 1998)"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s11047-014-9423-z","volume":"14","author":"A Winslow","year":"2015","unstructured":"Winslow, A.: Staged self-assembly and polyomino context-free grammars. Nat. Comput. 14(2), 293\u2013302 (2015)","journal-title":"Nat. Comput."},{"issue":"7748","key":"11_CR19","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1038\/s41586-019-1014-9","volume":"567","author":"D Woods","year":"2019","unstructured":"Woods, D., Doty, D., Myhrvold, C., Hui, J., Zhou, F., Yin, P., Winfree, E.: Diverse and robust molecular algorithms using reprogrammable dna self-assembly. Nature 567(7748), 366\u2013372 (2019)","journal-title":"Nature"}],"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-031-34034-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T18:06:42Z","timestamp":1689703602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34034-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340338","9783031340345"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34034-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jacksonville, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/ucnc2023\/","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":"24","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":"13","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":"54% - 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":"3","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.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)"}}]}}