Abstract
Biochemical networks are usually modeled by Ordinary Differential Equations (ODEs) that describe time evolution of the concentrations of the interacting (biochemical) species for specific initial concentrations and certain values of the interaction rates. The uncertainty in the measurements of the model parameters (i.e. interaction rates) and the concentrations (i.e. state variables) is not an uncommon occurrence due to biological variability and noise. So, there is a great need to predict the evolution of the species for some intervals or probability distributions instead of specific initial conditions and parameter values. To this end, one can employ either phase portrait method together with bifurcation analysis as a dynamical system approach, or Dynamical Bayesian Networks (DBNs) in a probabilistic domain. The first approach is restricted to the case of a few number of parameters, while DBNs have recently been used for large biochemical networks. In this paper, we show that time-homogeneous ODE parameters can be efficiently estimated with Bayesian Networks. The accuracy and computation time of our approach is compared to two-slice time-invariant DBNs that have already been used for this purpose. The efficiency of our approach is demonstrated on two toy examples and the EGF-NGF signaling pathway.
This work was financed by the join ANR-JST project CyPhAI.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bortolussi, L., Palmieri, L.: Deep abstractions of chemical reaction networks. In: Češka, M., Šafránek, D. (eds.) CMSB 2018. LNCS, vol. 11095, pp. 21–38. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99429-1_2
Boyen, X., Koller, D.: Approximate learning of dynamic models. In: Advances in Neural Information Processing Systems, vol. 11(NIPS 1998), pp. 396–402. MIT Press, Cambridge (1999)
Brown, K.S., et al.: The statistical mechanics of complex signaling networks: nerve growth factor signaling. Phys. Biol. 1(3), 184 (2004)
Butcher, J.C.: A history of Runge-Kutta methods. Appl. Numer. Math. 20(3), 247–260 (1996)
Butcher, J.C.: Numerical Methods for Ordinary Differential Equations. Wiley, Hoboken (2016)
Deuflhard, P., Hairer, E., Zugck, J.: One-step and extrapolation methods for differential-algebraic systems. Numer. Math. 51, 501–516 (1987)
Durrett, R.: Probability: Theory and Examples, vol. 49. Cambridge University Press, Cambridge (2019)
Faure, H., Lemieux, C.: Generalized Halton sequences in 2008: a comparative study. ACM Trans. Model. Comput. Simul. (TOMACS) 19(4), 1–31 (2009)
Gillespie, D.T.: A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J. Comput. Phys. 22(4), 403–434 (1976)
Hirsch, M.W., Smale, S., Devaney, R.L.: Differential Equations, Dynamical Systems, and an Introduction to Chaos. Academic Press, Cambridge (2012)
Huang, C., Darwiche, A.: Inference in belief networks: a procedural guide. Int. J. Approx. Reason. 15(3), 225–263 (1996)
Liebermeister, K.: Biochemical networks with uncertain parameters. Syst. Biol. 152, 97–107 (2005)
Liu, B., et al.: Approximate probabilistic analysis of biopathway dynamics. Bioinformatics 28, 1508–1516 (2012)
Liu, B., Hsu, D., Thiagarajan, P.S.: Probabilistic approximations of ODEs based bio-pathway dynamics. Theor. Comput. Sci. 412(21), 2188–2206 (2011)
Matsuno, H., Fujita, S., Doi, A., Nagasaki, M., Miyano, S.: Towards biopathway modeling and simulation. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 3–22. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-44919-1_2
Murphy, K., et al.: The Bayes net toolbox for Matlab. Comput. Sci. Stat. 33(2), 1024–1034 (2001)
Murphy, K., Weiss, Y.: The factored frontier algorithm for approximate inference in DBNs. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 378–385 (2001)
Murphy, K.P.: Probabilistic Machine Learning: An Introduction. MIT Press, Cambridge (2022)
Schnoerr, D., Sanguinetti, G., Grima, R.: Approximation and inference methods for stochastic biochemical kinetics-a tutorial review. J. Phys. A: Math. Theor. 50(9), 093001 (2017)
Skilling, J.: Bayesian solution of ordinary differential equations. Maximum Entropy Bayesian Meth. Seattle 1991, 23–37 (1992)
Trivedi, K.: Probability and Statistics with Reliability, Queuing and Computer Science Applications. Wiley, Hoboken (2001)
Tronarp, F., Kersting, H., Särkkä, S., Hennig, P.: Probabilistic solutions to ordinary differential equations as nonlinear Bayesian filtering: a new perspective. Stat. Comput. 29, 1297–1315 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
The HFPN model of the EGF-NGF signaling pathway [14]. The HFPN representation of chemical networks is detailed in [15]. In a few words, circles (places) represent species, squares (transitions) represent reactions, and arrows represent how the species are involved in the reactions, dashed arrows mean that the species are not consumed (like in enzyme reactions).
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Le Coënt, A., Barbot, B., Pekergin, N., Güzeliş, C. (2023). Bayesian Networks as Approximations of Biochemical Networks. In: Iacono, M., Scarpa, M., Barbierato, E., Serrano, S., Cerotti, D., Longo, F. (eds) Computer Performance Engineering and Stochastic Modelling. EPEW ASMTA 2023 2023. Lecture Notes in Computer Science, vol 14231. Springer, Cham. https://doi.org/10.1007/978-3-031-43185-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-43185-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43184-5
Online ISBN: 978-3-031-43185-2
eBook Packages: Computer ScienceComputer Science (R0)