首页> 外文会议>IFAC Conference on Foundations of Systems Biology in Engineering >Efficient computation of steady states in large-scale ODE models of biochemical reaction networks
【24h】

Efficient computation of steady states in large-scale ODE models of biochemical reaction networks

机译:生物化学反应网络大型颂歌模型中高效计算

获取原文

摘要

In systems and computational biology, ordinary differential equations are used for the mechanistic modelling of biochemical networks. These models can easily have hundreds of states and parameters. Typically most parameters are unknown and estimated by fitting model output to observation. During parameter estimation the model needs to be solved repeatedly, sometimes millions of times. This can then be a computational bottleneck, and limits the employment of such models. In many situations the experimental data provides information about the steady state of the biochemical reaction network. In such cases one only needs to obtain the equilibrium state for a given set of model parameters. In this paper we exploit this fact and solve the steady state problem directly rather than integrating the ODE forward in time until steady state is reached. We use Newton’s method - like some previous studies - and develop several improvements to achieve robust convergence. To address the reliance of Newtons method on good initial guesses, we propose a continuation method. We show that the method works robustly in this setting and achieves a speed up of up to 100 compared to using ODE solves.
机译:在系统和计算生物学中,普通微分方程用于生物化学网络的机制建模。这些模型可以很容易地具有数百个状态和参数。通常,大多数参数都是未知的并且通过拟合模型输出来观察来估计。在参数估计期间,需要重复解决模型,有时需要数百万次。然后,这可以是计算瓶颈,并限制了这种模型的就业。在许多情况下,实验数据提供了有关生物化学反应网络稳定状态的信息。在这种情况下,只需要获得给定的一组模型参数的均衡状态。在本文中,我们利用了这一事实并直接解决了稳态问题,而不是在达到稳定状态之前将前向前集成ODE。我们使用牛顿的方法 - 像以前的一些研究一样 - 并制定几种改进,以实现强大的融合。为了解决Newtons方法对良好猜测的依赖,我们提出了一种延续方法。我们表明该方法在此设置中稳健地工作,与使用ODE解决方案相比,达到最多100的加速。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号