Reachability, persistence, and constructive chemical reaction networks (part III): a mathematical formalism for binary enzymatic networks and application to persistence

  • Gilles GnacadjaEmail author
Original Paper


Chemical Reaction Network Theory is concerned with understanding the properties of systems of reactions from their structure. Enzymatic networks receive significant attention in the field because they are crucial in biochemistry and often illustrate the network features that are studied. In this paper we propose a formalism for binary enzymatic networks which can be used to research their mathematical properties. The networks are binary in that every enzyme-substrate complex consists of one enzyme and one substrate. Many connected concepts, e.g. futile enzymatic cycles and enzymatic cascades, are defined rigorously and so as to reflect the corresponding biochemical phenomena. We prove that binary enzymatic networks that are futile and cascaded are vacuously persistent: no species will tend to extinction if all species are implicitly present at initial time. This result extends prior work of Angeli, De Leenheer and Sontag in which a theorem was applied to show that certain particular enzymatic networks are persistent. This paper completes a series of three articles. It applies both the first paper which studies vacuous persistence and the second paper which describes a formalism for species composition.


Binary enzymatic networks Futile enzymatic cycle Enzymatic cascade Vacuous persistence Reachability Chemical reaction network 

Mathematics Subject Classification (2010)

92C42 92C45 34D05 


  1. 1.
    Angeli D., De Leenheer P., Sontag E.D.: A Petri net approach to the study of persistence in chemical reaction networks. Math. Biosci. 210(2), 598–618 (2007). doi: 10.1016/j.mbs.2007.07.003 CrossRefGoogle Scholar
  2. 2.
    A. Cornish-Bowden, Fundamentals of Enzyme Kinetics, 3rd ed. (Portland Press, 2004) ISBN 1855781581Google Scholar
  3. 3.
    Craciun G., Tang Y., Feinberg M.: Understanding bistability in complex enzyme-driven reaction networks. Proc. Natl. Acad. Sci. USA 103(23), 8697–8702 (2006). doi: 10.1073/pnas.0602767103 CrossRefGoogle Scholar
  4. 4.
    G. Gnacadja, Reachability, persistence, and constructive chemical reaction networks (part I): reachability approach to the persistence of chemical reaction networks, J. Math. Chem. (2011). doi: 10.1007/s10910-011-9894-4
  5. 5.
    G. Gnacadja, Reachability, persistence, and constructive chemical reaction networks (part II): a formalism for species composition in chemical reaction network theory and application to persistence. J. Math. Chem. (2011). doi: 10.1007/s10910-011-9896-2
  6. 6.
    Gunawardena J.: Distributivity and processivity in multisite phosphorylation can be distinguished through steady-state invariants. Biophys. J. 93(11), 3828–3834 (2007). doi: 10.1529/biophysj.107.110866 CrossRefGoogle Scholar
  7. 7.
    M. Pérez Millán, A. Dickenstein, A. Shiu, C. Conradi, Chemical Reaction Systems with Toric Steady States,
  8. 8.
    Salazar C., Höfer T.: Multisite protein phosphorylation—from molecular mechanisms to kinetic models. FEBS J. 276(12), 3177–3198 (2009). doi: 10.1111/j.1742-4658.2009.07027.x CrossRefGoogle Scholar
  9. 9.
    Siegel D., MacLean D.: Global stability of complex balanced mechanisms. J. Math. Chem. 27, 89–110 (2000). doi: 10.1023/A:1019183206064 CrossRefGoogle Scholar
  10. 10.
    Thomson M., Gunawardena J.: The rational parameterisation theorem for multisite post-translational modification systems. J. Theor. Biol. 261(4), 626–636 (2009). doi: 10.1016/j.jtbi.2009.09.003 CrossRefGoogle Scholar
  11. 11.
    Wang L., Sontag E.D.: On the number of steady states in a multiple futile cycle. J. Math. Biol. 57(1), 29–52 (2008). doi: 10.1007/s00285-007-0145-z CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Research and Development Information Systems, Amgen, Inc., One Amgen Center DriveThousand OaksUSA

Personalised recommendations