Skip to main content
Top

21-01-2022

ALCH: An imperative language for chemical reaction network-controlled tile assembly

Authors: Titus H. Klinge, James I. Lathrop, Sonia Moreno, Hugh D. Potter, Narun K. Raman, Matthew R. Riley

Published in: Natural Computing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Schiefer and Winfree recently introduced the chemical reaction network-controlled tile assembly model (CRN-TAM), a variant of the abstract tile assembly model (aTAM). In the CRN-TAM, tile reactions are mediated via non-local chemical signals controlled by a chemical reaction network. This paper introduces ALCH, an imperative programming language for specifying CRN-TAM programs that can be compiled and simulated. ALCH includes standard language features such as Boolean variables, conditionals, loops, and CRN-TAM-specific constructs such as adding and removing tiles. ALCH also includes the branch and parallel structures which harness the nondeterministic and parallel nature of the CRN-TAM. ALCH also supports functional tileset specification. Using ALCH, we show that the discrete Sierpinski triangle and the discrete Sierpinski carpet can be strictly self-assembled in the CRN-TAM, which shows the CRN-TAM can self-assemble infinite shapes at scale 1 that the aTAM cannot. ALCH allows us to present these constructions at a high level, abstracting species and reactions into C-like code that is simpler to understand. We employ two new CRN-TAM techniques in our constructions. First, we use ALCH’s nondeterministic branching feature to probe previously placed tiles of the assembly and detect the presence and absence of tiles. Second, we use scaffolding tiles to precisely control tile placement by occluding any undesired binding sites. This paper is an extension of our previous work, updated to include a Sierpinski carpet construction and the parallel command.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
The ALCH compiler and the CRN-TAM simulator, together with examples and visual illustrations, are available at http://​web.​cs.​iastate.​edu/​~lamp.
 
Literature
go back to reference 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–253CrossRef 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–253CrossRef
go back to reference 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–248, Springer International Publishing, 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–248, Springer International Publishing,
go back to reference Becker F (2009) Pictures worth a thousand tiles, a geometrical programming language for self-assembly. Theor Comput Sci, 410(16):1495–1515 Becker F (2009) Pictures worth a thousand tiles, a geometrical programming language for self-assembly. Theor Comput Sci, 410(16):1495–1515
go back to reference 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–379, Cham, Springer International Publishing 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–379, Cham, Springer International Publishing
go back to reference Cook M, Soloveichik D, Winfree E, Bruck J (2009) Programmability of chemical reaction networks. In algorithmic bioprocesses, Natural Computing Series, pages 543–584. Springer Cook M, Soloveichik D, Winfree E, Bruck J (2009) Programmability of chemical reaction networks. In algorithmic bioprocesses, Natural Computing Series, pages 543–584. Springer
go back to reference 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 ’19, pages 34–42, New York, NY, USA, July. Association for Computing Machinery 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 ’19, pages 34–42, New York, NY, USA, July. Association for Computing Machinery
go back to reference 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–310. IEEE. 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–310. IEEE.
go back to reference 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–34, Springer, Berlin 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–34, Springer, Berlin
go back to reference Epstein IR, Pojman JA (1998) An introduction to nonlinear chemical dynamics: Oscillations, Waves, Patterns, and Chaos. Oxford University Press Epstein IR, Pojman JA (1998) An introduction to nonlinear chemical dynamics: Oscillations, Waves, Patterns, and Chaos. Oxford University Press
go back to reference 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érôme Feret and Heinz Koeppl, editors, proceedings of the 14th international conference on computational methods in systems biology, Lecture Notes in Computer Science, pp 108–127, Springer 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érôme Feret and Heinz Koeppl, editors, proceedings of the 14th international conference on computational methods in systems biology, Lecture Notes in Computer Science, pp 108–127, Springer
go back to reference Feinberg M (2019) Foundations of chemical reaction network theory. Springer, Feinberg M (2019) Foundations of chemical reaction network theory. Springer,
go back to reference 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–119. Springer International Publishing 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–119. Springer International Publishing
go back to reference Furcy D, Summers SM, Wendlandt C (2021) Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D. Theoretical Computer Science Furcy D, Summers SM, Wendlandt C (2021) Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D. Theoretical Computer Science
go back to reference Gillespie DT (1976) A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J Comput Phys, 22(4):403–434 Gillespie DT (1976) A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J Comput Phys, 22(4):403–434
go back to reference 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–2624 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–2624
go back to reference 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–87, Springer 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–87, Springer
go back to reference 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–6:22, Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum für Informatik 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–6:22, Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum für Informatik
go back to reference Lathrop JI, Lutz JH, Summers SM (2009) Strict self-assembly of discrete Sierpinski triangles. Theoret Comput Sci 410(4):384–405MathSciNetCrossRef Lathrop JI, Lutz JH, Summers SM (2009) Strict self-assembly of discrete Sierpinski triangles. Theoret Comput Sci 410(4):384–405MathSciNetCrossRef
go back to reference Anthony M L, Liekens , Chrisantha T. Fernando (2007) Turing complete catalytic particle computers. In advances in artificial life, pages 1202–1211. Springer Berlin Heidelberg, Anthony M L, Liekens , Chrisantha T. Fernando (2007) Turing complete catalytic particle computers. In advances in artificial life, pages 1202–1211. Springer Berlin Heidelberg,
go back to reference Meunier P-É, 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–341. ACM, Meunier P-É, 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–341. ACM,
go back to reference 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–54. Springer International Publishing 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–54. Springer International Publishing
go back to reference 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–182. Springer International Publishing, 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–182. Springer International Publishing,
go back to reference Seeman NC (1982) Nucleic acid junctions and lattices. J Theor Biol 99(2):237–247CrossRef Seeman NC (1982) Nucleic acid junctions and lattices. J Theor Biol 99(2):237–247CrossRef
go back to reference Eric E. 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 ’19, page 14–23, New York, NY, USA, . Association for Computing Machinery Eric E. 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 ’19, page 14–23, New York, NY, USA, . Association for Computing Machinery
go back to reference Soloveichik D, Cook M, Winfree E, Bruck J (2008) Computation with finite stochastic chemical reaction networks. Nat Comput 7(4):615–633MathSciNetCrossRef Soloveichik D, Cook M, Winfree E, Bruck J (2008) Computation with finite stochastic chemical reaction networks. Nat Comput 7(4):615–633MathSciNetCrossRef
go back to reference Winfree (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology, Winfree (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology,
go back to reference 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–20. Springer International Publishing 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–20. Springer International Publishing
Metadata
Title
ALCH: An imperative language for chemical reaction network-controlled tile assembly
Authors
Titus H. Klinge
James I. Lathrop
Sonia Moreno
Hugh D. Potter
Narun K. Raman
Matthew R. Riley
Publication date
21-01-2022
Publisher
Springer Netherlands
Published in
Natural Computing
Print ISSN: 1567-7818
Electronic ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-021-09878-8

Premium Partner