首页> 外文会议>European simulation and modelling conference >MARKOV CHAIN MONTE CARLO METHODS TO ANALYZE THE STEADY-STATE FLUX SOLUTION SPACE OF METABOLIC NETWORK MODELS
【24h】

MARKOV CHAIN MONTE CARLO METHODS TO ANALYZE THE STEADY-STATE FLUX SOLUTION SPACE OF METABOLIC NETWORK MODELS

机译:代谢网络模型稳态通量解空间的马尔可夫链蒙特卡罗方法

获取原文

摘要

The steady-state flux solution space of a metabolic network model represents a convex polytope. Determining the size and shape of the flux solution space can give valuable information for a better understanding of the fluxes operating metabolic processes within living cells. For realistic problems, the polytope is usually high dimensional. Computing its volume analytically is proven to be #P-hard (Dyer and Frieze 1998). Therefore, Monte Carlo methods are used to approximate the volume numerically. To cope with high-dimensional problems (> 20 dimensions), naive Monte Carlo approaches, however, generally fail. We propose a new Markov Chain Monte Carlo method in combination with a Hit and Run algorithm that is able to cope with the volume estimation problem in high dimensions. Based on quantitative measures we analyze the performance of our algorithm. By application to an example metabolic network model of realistic size we could demonstrate reasonable running times even without taking paral-lelization into account. The results show that Markov Chain methods are capable to analyze the size and shape of flux solution spaces for large-scale network models. Thus, flux space volume estimation has the potential to become a new member of the computational toolset for constraint based modeling.
机译:代谢网络模型的稳态通量解空间表示凸多面体。确定通量溶液空间的大小和形状可以提供有价值的信息,以便更好地了解通量在活细胞内代谢过程的通量。对于现实问题,多面体通常是高维的。解析地计算其体积被证明是困难的(Dyer and Frieze 1998)。因此,使用蒙特卡洛方法在数值上近似体积。为了解决高维问题(> 20维),幼稚的蒙特卡洛方法通常会失败。我们提出了一种新的马尔可夫链蒙特卡洛方法,并结合了“即点即用”算法,该算法能够应对高维中的体积估计问题。基于定量度量,我们分析了算法的性能。通过将示例应用于实际大小的代谢网络模型,即使不考虑并行化,我们也可以证明合理的运行时间。结果表明,马尔可夫链方法能够分析大规模网络模型通量解空间的大小和形状。因此,通量空间体积估计有可能成为基于约束的建模的计算工具集的新成员。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号