skip to main content
Idioma:

Rate-independent Computation in Continuous Chemical Reaction Networks

Chen, Ho-Lin ; Doty, David ; Reeves, Wyatt ; Soloveichik, David

Journal of the ACM, 2023-06, Vol.70 (3), p.1-61, Article 22 [Periódico revisado por pares]

New York, NY: ACM

Texto completo disponível

Citações Citado por
  • Título:
    Rate-independent Computation in Continuous Chemical Reaction Networks
  • Autor: Chen, Ho-Lin ; Doty, David ; Reeves, Wyatt ; Soloveichik, David
  • Assuntos: Analog computers ; Chemical reactions ; Computer networks ; Computer systems organization ; Continuity (mathematics) ; Distributed processing ; Kinetics ; Linear functions ; Models of computation ; Networks ; Principles ; Representations ; Theory of computation
  • É parte de: Journal of the ACM, 2023-06, Vol.70 (3), p.1-61, Article 22
  • Descrição: Understanding the algorithmic behaviors that are in principle realizable in a chemical system is necessary for a rigorous understanding of the design principles of biological regulatory networks. Further, advances in synthetic biology herald the time when we will be able to rationally engineer complex chemical systems and when idealized formal models will become blueprints for engineering. Coupled chemical interactions in a well-mixed solution are commonly formalized as chemical reaction networks (CRNs). However, despite the widespread use of CRNs in the natural sciences, the range of computational behaviors exhibited by CRNs is not well understood. Here, we study the following problem: What functions f : ℝk → ℝ can be computed by a CRN, in which the CRN eventually produces the correct amount of the “output” molecule, no matter the rate at which reactions proceed? This captures a previously unexplored but very natural class of computations: For example, the reaction X1 + X2 → Y can be thought to compute the function y = min (x1, x2). Such a CRN is robust in the sense that it is correct whether its evolution is governed by the standard model of mass-action kinetics, alternatives such as Hill-function or Michaelis-Menten kinetics, or other arbitrary models of chemistry that respect the (fundamentally digital) stoichiometric constraints (what are the reactants and products?). We develop a reachability relation based on a broad notion of “what could happen” if reaction rates can vary arbitrarily over time. Using reachability, we define stable computation analogously to probability 1 computation in distributed computing and connect it with a seemingly stronger notion of rate-independent computation based on convergence in the limit t → ∞ under a wide class of generalized rate laws. Besides the direct mapping of a concentration to a nonnegative analog value, we also consider the “dual-rail representation” that can represent negative values as the difference of two concentrations and allows the composition of CRN modules. We prove that a function is rate-independently computable if and only if it is piecewise linear (with rational coefficients) and continuous (dual-rail representation), or non-negative with discontinuities occurring only when some inputs switch from zero to positive (direct representation). The many contexts where continuous piecewise linear functions are powerful targets for implementation, combined with the systematic construction we develop for computing these functions, demonstrate the potential of rate-independent chemical computation.
  • Editor: New York, NY: ACM
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.