代谢网络可行空间的解析逼近
An analytic approximation of the feasible space of metabolic networks
摘要:
假设一个细胞内的稳态条件下,代谢通量满足一个欠定的线性系统的化学计量方程。表征满足这些方程的通量空间以及给定的边界(可能还有其他相关的约束)被认为是理解细胞代谢的最重要的。每个单独通量的极值可以用线性规划计算(如通量平衡分析),其边际分布可以用蒙特卡罗抽样近似计算。在这里,我们提出了一个近似的分析方法,后者的任务的基础上期望传播方程,不涉及采样,可以实现更好的预测比其他现有的分析方法。该方法是迭代的,并且其计算时间由每次迭代的一个矩阵求逆决定。关于采样,我们通过大量的模拟表明,它具有一些优势,包括计算时间,并能够有效地固定经验估计的通量分布。
英文摘要:
Assuming a steady-state condition within a cell, metabolic fluxes satisfy an under-determined linear system of stoichiometric equations. Characterizing the space of fluxes that satisfy such equations along with given bounds (and possibly additional relevant constraints) is considered of utmost importance for the understanding of cellular metabolism. Extreme values for each individual flux can be computed with Linear Programming (as Flux Balance Analysis), and their marginal distributions can be approximately computed with Monte-Carlo sampling. Here we present an approximate analytic method for the latter task based on Expectation Propagation equations that does not involve sampling and can achieve much better predictions than other existing analytic methods. The method is iterative, and its computation time is dominated by one matrix inversion per iteration. With respect to sampling, we show through extensive simulation that it has some advantages including computation time, and the ability to efficiently fix empirically estimated distributions of fluxes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。