最小化有效群落动态通量平衡分析的优化次数
Minimizing the number of optimizations for efficient community dynamic flux balance analysis
摘要:
动态通量平衡分析使用准稳态假设,使用众所周知的通量平衡分析技术,来计算在动态模拟的每个时间步的生物体的代谢活性。对于微生物群落,这种计算特别昂贵,并且涉及在每个时间步为群落的每个成员求解线性约束优化问题。然而,这是不必要的和低效的,因为先前的解决方案可以用于通知未来的时间步长。在这里,我们表明,可以为社区中的每种微生物选择内部通量空间的基础,并且该基础可以用于通过在大多数时间步长求解相对便宜的线性方程组来模拟前进。只要得到的代谢活性保持在优化问题的约束内(即线性方程组的解对于线性规划保持可行),我们就可以使用该解。当解变得不可行时,它首先成为优化问题的可行但退化的解,并且我们可以解决不同但相关的优化问题以选择适当的基来继续向前模拟。我们证明了我们的方法的效率和鲁棒性,通过比较目前使用的方法对四个物种的社区,并表明我们的方法需要至少$91\%$更少的优化来解决。为了重现性,我们使用Python对该方法进行了原型化。源代码可从\verb获得|https://github.com/jdbrunner/surfin_fba|.
英文摘要:
Dynamic flux balance analysis uses a quasi-steady state assumption to calculate an organism's metabolic activity at each time-step of a dynamic simulation, using the well-known technique of flux balance analysis. For microbial communities, this calculation is especially costly and involves solving a linear constrained optimization problem for each member of the community at each time step. However, this is unnecessary and inefficient, as prior solutions can be used to inform future time steps. Here, we show that a basis for the space of internal fluxes can be chosen for each microbe in a community and this basis can be used to simulate forward by solving a relatively inexpensive system of linear equations at most time steps. We can use this solution as long as the resulting metabolic activity remains within the optimization problem's constraints (i.e. the solution to the linear system of equations remains a feasible to the linear program). As the solution becomes infeasible, it first becomes a feasible but degenerate solution to the optimization problem, and we can solve a different but related optimization problem to choose an appropriate basis to continue forward simulation. We demonstrate the efficiency and robustness of our method by comparing with currently used methods on a four species community, and show that our method requires at least $91\%$ fewer optimizations to be solved. For reproducibility, we prototyped the method using Python. Source code is available at \verb|https://github.com/jdbrunner/surfin_fba|.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。