{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:37Z","timestamp":1740136177158,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1900716","1545028"],"award-info":[{"award-number":["1900716","1545028"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11047-021-09878-8","type":"journal-article","created":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:04:20Z","timestamp":1642723460000},"page":"365-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["ALCH: An imperative language for chemical reaction network-controlled tile assembly"],"prefix":"10.1007","volume":"23","author":[{"given":"Titus H.","family":"Klinge","sequence":"first","affiliation":[]},{"given":"James I.","family":"Lathrop","sequence":"additional","affiliation":[]},{"given":"Sonia","family":"Moreno","sequence":"additional","affiliation":[]},{"given":"Hugh D.","family":"Potter","sequence":"additional","affiliation":[]},{"given":"Narun K.","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Matthew R.","family":"Riley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,21]]},"reference":[{"issue":"4","key":"9878_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R (2006) Computation in networks of passively mobile finite-state sensors. Distrib Comput 18(4):235\u2013253","journal-title":"Distrib Comput"},{"key":"9878_CR2","doi-asserted-by":"crossref","unstructured":"Badelt S, Shin SW, Johnson RF, Dong Q, Thachuk C, Winfree E. (2017) A general-purpose CRN-to-DSD compiler with formal verification, optimization, and simulation capabilities. In Robert Brijder and Lulu Qian, editors, proceedings of the 23rd international conference on DNA computing and molecular programming, lecture notes in computer science, pp 232\u2013248, Springer International Publishing,","DOI":"10.1007\/978-3-319-66799-7_15"},{"key":"9878_CR3","doi-asserted-by":"crossref","unstructured":"Becker F (2009) Pictures worth a thousand tiles, a geometrical programming language for self-assembly. Theor Comput Sci, 410(16):1495\u20131515","DOI":"10.1016\/j.tcs.2008.12.011"},{"key":"9878_CR4","doi-asserted-by":"crossref","unstructured":"Cardelli L (2020) Kaemika app: integrating protocols and chemical simulation. In Alessandro Abate, Tatjana Petrov, and Verena Wolf, editors, computational methods in systems biology, pages 373\u2013379, Cham, Springer International Publishing","DOI":"10.1007\/978-3-030-60327-4_22"},{"key":"9878_CR5","doi-asserted-by":"crossref","unstructured":"Cook M, Soloveichik D, Winfree E, Bruck J (2009) Programmability of chemical reaction networks. In algorithmic bioprocesses, Natural Computing Series, pages 543\u2013584. Springer","DOI":"10.1007\/978-3-540-88869-7_27"},{"key":"9878_CR6","doi-asserted-by":"crossref","unstructured":"David Doty, Eftekhari M (2019) Efficient size estimation and impossibility of termination in uniform dense population protocols. In proceedings of the 2019 ACM symposium on principles of distributed computing, PODC \u201919, pages 34\u201342, New York, NY, USA, July. Association for Computing Machinery","DOI":"10.1145\/3293611.3331627"},{"key":"9878_CR7","doi-asserted-by":"crossref","unstructured":"David Doty, Jack H Lutz, Matthew J Patitz, Robert T Schweller, Scott M Summers, Damien Woods (2012) The tile assembly model is intrinsically universal. In proceedings of the 53rd symposium on foundations of computer science, pp 302\u2013310. IEEE.","DOI":"10.1109\/FOCS.2012.76"},{"key":"9878_CR8","doi-asserted-by":"crossref","unstructured":"David Doty, Matthew J. Patitz (2009) A domain-specific language for programming in the tile assembly model. In proceedings of the 17th international conference on DNA computing and molecular programming, pp 25\u201334, Springer, Berlin","DOI":"10.1007\/978-3-642-10604-0_3"},{"key":"9878_CR9","doi-asserted-by":"crossref","unstructured":"Epstein IR, Pojman JA (1998) An introduction to nonlinear chemical dynamics: Oscillations, Waves, Patterns, and Chaos. Oxford University Press","DOI":"10.1093\/oso\/9780195096705.001.0001"},{"key":"9878_CR10","doi-asserted-by":"crossref","unstructured":"Fages F, Le Guludec G, Bournez O, Pouly A (2017) Strong Turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs. In J\u00e9r\u00f4me Feret and Heinz Koeppl, editors, proceedings of the 14th international conference on computational methods in systems biology, Lecture Notes in Computer Science, pp 108\u2013127, Springer","DOI":"10.1007\/978-3-319-67471-1_7"},{"key":"9878_CR11","doi-asserted-by":"crossref","unstructured":"Feinberg M (2019) Foundations of chemical reaction network theory. Springer,","DOI":"10.1007\/978-3-030-03858-8"},{"key":"9878_CR12","doi-asserted-by":"crossref","unstructured":"Furcy D, Summers SM, Wendlandt C (2019) New bounds on the tile complexity of thin rectangles at temperature-1. In proceedings of the 25rd international conference on DNA computing and molecular programming, pages 100\u2013119. Springer International Publishing","DOI":"10.1007\/978-3-030-26807-7_6"},{"key":"9878_CR13","doi-asserted-by":"crossref","unstructured":"Furcy D, Summers SM, Wendlandt C (2021) Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D. Theoretical Computer Science","DOI":"10.1016\/j.tcs.2021.02.001"},{"key":"9878_CR14","doi-asserted-by":"crossref","unstructured":"Gillespie DT (1976) A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J Comput Phys, 22(4):403\u2013434","DOI":"10.1016\/0021-9991(76)90041-3"},{"key":"9878_CR15","doi-asserted-by":"crossref","unstructured":"Hader D, Koch A, Patitz MJ, Sharp M (2020) The impacts of dimensionality, diffusion, and directedness on intrinsic universality in the abstract tile assembly model. In proceedings of the ACM-SIAM symposium on discrete algorithms (SODA), pages 2607\u20132624","DOI":"10.1137\/1.9781611975994.159"},{"key":"9878_CR16","doi-asserted-by":"crossref","unstructured":"Steven M. Kautz, James I, Lathrop (2009) Self-assembly of the Discrete Sierpinski Carpet and Related Fractals. In proceedings of the 15th international conference on DNA computing and molecular programming, volume 5877 of lecture notes in computer science, pp 78\u201387, Springer","DOI":"10.1007\/978-3-642-10604-0_8"},{"key":"9878_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tcs.2020.01.008","volume":"816","author":"TH Klinge","year":"2020","unstructured":"Klinge TH, Lathrop JI, Lutz JH (2020) Robust biomolecular finite automata. Theoret Comput Sci 816:114\u2013143","journal-title":"Theoret Comput Sci"},{"key":"9878_CR18","unstructured":"Titus H. Klinge, James I. Lathrop, Moreno S, Potter HD, Raman NK, and Riley MR (2020) ALCH: an imperative language for chemical reaction network-controlled tile assembly. In Cody Geary and Matthew J. Patitz, editors, 26th international conference on DNA computing and molecular programming (DNA 26), volume 174 of Leibniz international proceedings in informatics (LIPIcs), pages 6:1\u20136:22, Dagstuhl, Germany, Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"4","key":"9878_CR19","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"JI Lathrop","year":"2009","unstructured":"Lathrop JI, Lutz JH, Summers SM (2009) Strict self-assembly of discrete Sierpinski triangles. Theoret Comput Sci 410(4):384\u2013405","journal-title":"Theoret Comput Sci"},{"key":"9878_CR20","doi-asserted-by":"crossref","unstructured":"Anthony M\u00a0L, Liekens , Chrisantha\u00a0T. Fernando (2007) Turing complete catalytic particle computers. In advances in artificial life, pages 1202\u20131211. Springer Berlin Heidelberg,","DOI":"10.1007\/978-3-540-74913-4_120"},{"key":"9878_CR21","doi-asserted-by":"crossref","unstructured":"Meunier P-\u00c9, Woods D (2017)The non-cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation. In proceedings of the 49th annual ACM SIGACT symposium on theory of computing, pages 328\u2013341. ACM,","DOI":"10.1145\/3055399.3055446"},{"key":"9878_CR22","doi-asserted-by":"crossref","unstructured":"Schiefer N, Winfree E (2015) Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model. In proceedings of the 21st international conference on DNA computing and molecular programming, pages 34\u201354. Springer International Publishing","DOI":"10.1007\/978-3-319-21999-8_3"},{"key":"9878_CR23","doi-asserted-by":"crossref","unstructured":"Schiefer N, Winfree E (2016) Time complexity of computation and construction in the chemical reaction network-controlled tile assembly model. In proceedings of the 22nd international conference on DNA computing and molecular programming, pages 165\u2013182. Springer International Publishing,","DOI":"10.1007\/978-3-319-43994-5_11"},{"issue":"2","key":"9878_CR24","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"Nadrian C Seeman","year":"1982","unstructured":"Seeman NC (1982) Nucleic acid junctions and lattices. J Theor Biol 99(2):237\u2013247","journal-title":"J Theor Biol"},{"key":"9878_CR25","doi-asserted-by":"crossref","unstructured":"Eric\u00a0E. Severson, David Haley, David Doty(2019) Composable computation in discrete chemical reaction networks. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC \u201919, page 14\u201323, New York, NY, USA, . Association for Computing Machinery","DOI":"10.1145\/3293611.3331615"},{"issue":"4","key":"9878_CR26","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik D, Cook M, Winfree E, Bruck J (2008) Computation with finite stochastic chemical reaction networks. Nat Comput 7(4):615\u2013633","journal-title":"Nat Comput"},{"issue":"2","key":"9878_CR27","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11047-019-09775-1","volume":"19","author":"M Vasi\u0107","year":"2020","unstructured":"Vasi\u0107 M, Soloveichik D, Khurshid S (2020) CRN++: molecular programming language. Nat Comput 19(2):391\u2013407","journal-title":"Nat Comput"},{"key":"9878_CR28","unstructured":"Winfree (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology,"},{"key":"9878_CR29","doi-asserted-by":"crossref","unstructured":"Winfree E (2019) Chemical Reaction Networks and Stochastic Local Search. In Chris Thachuk and Yan Liu, editors, proceedings of the twenty-Fifth international conference on DNA computing and molecular programming, lecture notes in computer science, pages 1\u201320. Springer International Publishing","DOI":"10.1007\/978-3-030-26807-7_1"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-021-09878-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-021-09878-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-021-09878-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T19:05:24Z","timestamp":1722625524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-021-09878-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9878"],"URL":"https:\/\/doi.org\/10.1007\/s11047-021-09878-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2022,1,21]]},"assertion":[{"value":"6 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}