Efficient probabilistic inference in biochemical networks

Biochemical networks are usually modeled by ordinary differential equations that describe the time evolution of the concentrations of the interacting (biochemical) species for specific initial concentrations and certain values of the interaction rates. They consist, in general, of many variables and parameters. Parameter estimation of such systems using standard optimization algorithms is computationally expensive since a large number of numerical simulations must be performed for numerous values of initial conditions and parameters, making these approaches either inefficient or inaccurate. In this paper, we explain how biochemical networks can be approximated by dynamic Bayesian networks, a class of discrete probabilistic models. This type of approximation enables the use of Bayesian inference for performing tasks such as parameter estimation. We explain how to make this type of approximations and the subsequent parameter estimation task as accurate and computationally efficient as possible. Our approach is applied on concrete examples such as the EGF-NGF cellular signaling pathway.

Authors

Institutions

Publication Details

Journal
Computers in Biology and Medicine
Published
2024-10-25
DOI
https://doi.org/10.1016/j.compbiomed.2024.109280
Citations
2
Primary Topic
Gene Regulatory Network Analysis
Type
article
Field-Weighted Citation Impact
0.47
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient probabilistic inference in biochemical networks

Benoît Barbot, Adrien Le Coënt, Nihal Pekergin
2 citations
Computers in Biology and Medicine
Gene Regulatory Network Analysis
0.47
article

Efficient probabilistic inference in biochemical networks

Benoît Barbot, Adrien Le Coënt, Nihal Pekergin
article en
2 citations

Abstract

Biochemical networks are usually modeled by ordinary differential equations that describe the time evolution of the concentrations of the interacting (biochemical) species for specific initial concentrations and certain values of the interaction rates. They consist, in general, of many variables and parameters. Parameter estimation of such systems using standard optimization algorithms is computationally expensive since a large number of numerical simulations must be performed for numerous values of initial conditions and parameters, making these approaches either inefficient or inaccurate. In this paper, we explain how biochemical networks can be approximated by dynamic Bayesian networks, a class of discrete probabilistic models. This type of approximation enables the use of Bayesian inference for performing tasks such as parameter estimation. We explain how to make this type of approximations and the subsequent parameter estimation task as accurate and computationally efficient as possible. Our approach is applied on concrete examples such as the EGF-NGF cellular signaling pathway.

Computers in Biology and MedicineVol. 183
Université Paris-Est Créteil (FR)
Openalex Percentile: Top 34%
Gene Regulatory Network Analysis
0.47
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.