Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
The analysis of dynamic of chemical reaction networks by computing Hopf bifurcation is a method to understand the qualitative behavior of the network due to its relation to the existence of oscillations. For low dimensional reaction systems without additional constraints Hopf bifurcation can be computed by reducing the question of its occurrence to quantifier elimination problems on real closed fields. However deciding its occurrence in high dimensional system has proven to be difficult in practice. In this paper we present a fully algorithmic technique to compute Hopf bifurcation fixed point for reaction systems with linear conservation laws using reaction coordinates instead of concentration coordinates, a technique that extends the range of networks, which can be analyzed in practice, considerably.
KeywordsHopf Bifurcation Invariant Manifold System Biology Markup Language Stoichiometric Matrix Chemical Network
Unable to display preview. Download preview PDF.
- 3.Sturm, T., Weber, A., Abdel-Rahman, E., El Kahoui, M.: Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology. Mathematics in Computer Science 2(3) (2009), Special Issue on Symbolic Computation in BiologyGoogle Scholar
- 4.Clarke, B.L.: Stability of Complex Reaction Networks. Advances in Chemical Physics, vol. XLIII. Wiley Online Library (1980)Google Scholar
- 6.Shiu, A.J.: Algebraic methods for biochemical reaction network theory. Phd thesis, University of California, Berkeley (2010)Google Scholar
- 7.Pérez Millán, M., Dickenstein, A., Shiu, A., Conradi, C.: Chemical reaction systems with toric steady states. Bulletin of Mathematical Biology, 1–29 (October 2011)Google Scholar
- 9.Gawrilow, E., Joswig, M.: Polymake: a framework for analyzing convex polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes—Combinatorics and Computation. Oberwolfach Seminars, vol. 29, pp. 43–73. Birkhäuser, Basel (2000), 10.1007/978-3-0348-8438-9_2Google Scholar
- 12.Sturm, T.: Redlog online resources for applied quantifier elimination. Acta Academiae Aboensis, Ser. B 67(2), 177–191 (2007)Google Scholar
- 13.Weispfenning, V.: The complexity of linear problems in fields. Journal of Symbolic Computation 5(1&2), 3–27 (1988)Google Scholar
- 18.Larhlimi, A.: New Concepts and Tools in Constraint-based Analysis of Metabolic Networks. Dissertation, University Berlin, GermanyGoogle Scholar
- 19.Dräger, A., Rodriguez, N., Dumousseau, M., Dörr, A., Wrzodek, C., Keller, R., Fröhlich, S., Novère, N.L., Zell, A., Hucka, M.: JSBML: a flexible and entirely Java-based library for working with SBML. Bioinformatics 4 (2011)Google Scholar
- 20.Hucka, M., Smith, L., Wilkinson, D., Bergmann, F., Hoops, S., Keating, S., Sahle, S., Schaff, J.: The Systems Biology Markup Language (SBML): Language Specification for Level 3 Version 1 Core. In: Nature Precedings (October 2010)Google Scholar
- 23.Seiler, W.: Involution — The Formal Theory of Differential Equations and its Applications in Computer Algebra. Algorithms and Computation in Mathematics, vol. 24. Springer, Heidelberg (2009)Google Scholar