Novel Methods for Learning and Adaptation in Chemical Reaction Networks
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
List of Glossary Terms
List of Glossary Terms A Ageofaclusterorfuzzyrule 1054 A correlated equilibrium 3064 Agent 58, 76, 105, 1767, 2578, 3004 Amechanism 1837 Agent architecture 105 Anearestneighbor 790 Agent based models 2940 A social choice function 1837 Agent (or software agent) 2999 A stochastic game 3064 Agent-based computational models 2898 Astrategy 3064 Agent-based model 58 Abelian group 2780 Agent-based modeling 1767 Absolute temperature 940 Agent-based modeling (ABM) 39 Absorbing state 1080 Agent-based simulation 18, 88 Abstract game 675 Aggregation 862 Abstract game of network formation with respect to Aggregation operators 122 irreflexive dominance 2044 Aging 2564, 2611 Abstract game of network formation with respect to path Algebra 2925 dominance 2044 Algebraic models 2898 Accuracy 161, 827 Algorithm 2496 Accuracy (rate) 862 Algorithmic complexity of object x 132 Achievable mate 3235 Algorithmic self-assembly of DNA tiles 1894 Action profile 3023 Allowable set of partners 3234 Action set 3023 Almost equicontinuous CA 914, 3212 Action type 2656 Alphabet of a cellular automaton 1 Activation function 813 ˛-Level set and support 1240 Activator 622 Alternating independent-2-paths 2953 Active membranes 1851 Alternating k-stars 2953 Actors 2029 Alternating k-triangles 2953 Adaptation 39 Amorphous computer 147 Adaptive system 1619 Analog 3187 Additive cellular automata 1 Analog circuit 3260 Additively separable preferences 3235 Ancilla qubits 2478 Adiabatic switching 1998 Anisotropic elements 754 Adjacency matrix 1746, 3114 Annealed law 2564 Adjacent 2864, -
Programmability of Chemical Reaction Networks
Programmability of Chemical Reaction Networks Matthew Cook, David Soloveichik, Erik Winfree, and Jehoshua Bruck Abstract Motivated by the intriguing complexity of biochemical circuitry within individual cells we study Stochastic Chemical Reaction Networks (SCRNs), a for- mal model that considers a set of chemical reactions acting on a finite num- ber of molecules in a well-stirred solution according to standard chemical kinet- ics equations. SCRNs have been widely used for describing naturally occurring (bio)chemical systems, and with the advent of synthetic biology they become a promising language for the design of artificial biochemical circuits. Our interest here is the computational power of SCRNs and how they relate to more conventional models of computation. We survey known connections and give new connections between SCRNs and Boolean Logic Circuits, Vector Addition Systems, Petri nets, Gate Implementability, Primitive Recursive Functions, Register Machines, Fractran, and Turing Machines. A theme to these investigations is the thin line between de- cidable and undecidable questions about SCRN behavior. 1 Introduction Stochastic chemical reaction networks (SCRNs) are among the most fundamental models used in chemistry, biochemistry, and most recently, computational biology. Traditionally, analysis has focused on mass action kinetics, where reactions are as- sumed to involve sufficiently many molecules that the state of the system can be accurately represented by continuous molecular concentrations with the dynamics given by deterministic differential equations. However, analyzing the kinetics of small-scale chemical processes involving a finite number of molecules, such as oc- curs within cells, requires stochastic dynamics that explicitly track the exact num- ber of each molecular species [1–3]. -
Programming and Simulating Chemical Reaction Networks on a Surface Royalsocietypublishing.Org/Journal/Rsif Samuel Clamons1, Lulu Qian1,2 and Erik Winfree1,2,3
Programming and simulating chemical reaction networks on a surface royalsocietypublishing.org/journal/rsif Samuel Clamons1, Lulu Qian1,2 and Erik Winfree1,2,3 1Bioengineering, 2Computer Science, and 3Computation and Neural Systems, California Institute of Technology, Research Pasadena, CA 91125, USA SC, 0000-0002-7993-2278; LQ, 0000-0003-4115-2409; EW, 0000-0002-5899-7523 Cite this article: Clamons S, Qian L, Winfree Models of well-mixed chemical reaction networks (CRNs) have provided a solid foundation for the study of programmable molecular systems, but the E. 2020 Programming and simulating chemical importance of spatial organization in such systems has increasingly been reaction networks on a surface. J. R. Soc. recognized. In this paper, we explore an alternative chemical computing Interface 17: 20190790. model introduced by Qian & Winfree in 2014, the surface CRN, which uses http://dx.doi.org/10.1098/rsif.2019.0790 molecules attached to a surface such that each molecule only interacts with its immediate neighbours. Expanding on the constructions in that work, we first demonstrate that surface CRNs can emulate asynchronous and synchro- nous deterministic cellular automata and implement continuously active Received: 23 November 2019 Boolean logic circuits. We introduce three new techniques for enforcing syn- Accepted: 30 April 2020 chronization within local regions, each with a different trade-off in spatial and chemical complexity. We also demonstrate that surface CRNs can manu- facture complex spatial patterns from simple initial conditions and implement interesting swarm robotic behaviours using simple local rules. Throughout all example constructions of surface CRNs, we highlight the trade-off between Subject Category: the ability to precisely place molecules and the ability to precisely control mol- Life Sciences–Engineering interface ecular interactions. -
Self-Assembled Nanostructures, Molecular Automata, and Chemical Reaction Networks
Molecules Computing: Self-Assembled Nanostructures, Molecular Automata, and Chemical Reaction Networks Thesis by David Soloveichik In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2008 (Defended May 5, 2008) ii c 2008 David Soloveichik All Rights Reserved iii Contents Acknowledgements vi Abstract vii 1 Introduction 1 1.1 ThePromiseofBionanotechnology . ........... 1 1.2 TheMathematicsofComputerScience. ............ 2 1.3 TheCriteriaforSuccess. .......... 3 1.4 TheContributions................................ ........ 3 1.4.1 TileSelf-Assembly. ...... 3 1.4.2 RestrictionEnzymeAutomata . ........ 4 1.4.3 ChemicalReactionNetworks . ....... 4 Bibliography ....................................... ...... 6 2 Complexity of Self-Assembled Shapes 8 2.1 Abstract........................................ ..... 8 2.2 Introduction.................................... ....... 8 2.3 TheTileAssemblyModel .. .... .... ... .... .... .... ... ....... 9 2.3.1 GuaranteeingUniqueProduction. .......... 10 2.4 ArbitrarilyScaledShapesandTheirComplexity . ................. 11 2.5 Relating Tile-Complexity and Kolmogorov Complexity . .................. 12 2.6 TheProgrammableBlockConstruction . ............ 13 2.6.1 Overview...................................... .. 13 2.6.2 ArchitectureoftheBlocks . ........ 14 2.6.2.1 GrowthBlocks................................ 14 2.6.2.2 SeedBlock.................................. 17 2.6.3 TheUnpackingProcess. ...... 17 2.6.4 Programming Blocks -
Computation with Finite Stochastic Chemical Reaction Networks
COMPUTATION WITH FINITE STOCHASTIC CHEMICAL REACTION NETWORKS DAVID SOLOVEICHIK∗, MATTHEW COOK†, ERIK WINFREE‡ , AND JEHOSHUA BRUCK§ Abstract. A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions, and interacting with its cellular environment. Strategies for incorporating logic in aqueous chemistry have focused primarily on implementing components, such as logic gates, that are composed into larger circuits, with each logic gate in the circuit corresponding to one or more molecular species. With this paradigm, designing and producing new molecular species is necessary to perform larger computations. An alternative approach begins by noticing that chemical systems on the small scale are fundamentally discrete and stochastic. In particular, the exact molecular counts of each molecular species present, is an intrinsically available form of information. This might appear to be a very weak form of information, perhaps quite difficult for computations to utilize. Indeed, it has been shown that error-free Turing universal computation is impossible in this setting. Nevertheless, we show a design of a chemical computer that achieves fast and reliable Turing-universal computation using molecular counts. Our scheme uses only a small number of different molecular species to do computation of arbitrary complexity. The total probability of error of the computation can be made arbitrarily small (but not zero) by adjusting the initial molecular counts of certain species. While physical implementations would be difficult, these results demonstrate that molecular counts can be a useful form of information for small molecular systems such as those operating within cellular environments.