Nair Govind, Jungreuthmayer Christian, Zanghellini Jürgen
Department of Biotechnology, University of Natural Resources and Life Sciences, Muthgasse 11, Vienna, 1190, Austria.
Austrian Centre of Industrial Biotechnology, Muthgasse 11, Vienna, 1190, Austria.
BMC Bioinformatics. 2017 Feb 1;18(1):78. doi: 10.1186/s12859-017-1483-5.
Knockout strategies, particularly the concept of constrained minimal cut sets (cMCSs), are an important part of the arsenal of tools used in manipulating metabolic networks. Given a specific design, cMCSs can be calculated even in genome-scale networks. We would however like to find not only the optimal intervention strategy for a given design but the best possible design too. Our solution (PSOMCS) is to use particle swarm optimization (PSO) along with the direct calculation of cMCSs from the stoichiometric matrix to obtain optimal designs satisfying multiple objectives.
To illustrate the working of PSOMCS, we apply it to a toy network. Next we show its superiority by comparing its performance against other comparable methods on a medium sized E. coli core metabolic network. PSOMCS not only finds solutions comparable to previously published results but also it is orders of magnitude faster. Finally, we use PSOMCS to predict knockouts satisfying multiple objectives in a genome-scale metabolic model of E. coli and compare it with OptKnock and RobustKnock.
PSOMCS finds competitive knockout strategies and designs compared to other current methods and is in some cases significantly faster. It can be used in identifying knockouts which will force optimal desired behaviors in large and genome scale metabolic networks. It will be even more useful as larger metabolic models of industrially relevant organisms become available.
基因敲除策略,尤其是约束最小割集(cMCSs)的概念,是用于操纵代谢网络的一系列工具的重要组成部分。给定特定设计,即使在基因组规模的网络中也可以计算cMCSs。然而,我们不仅希望找到给定设计的最优干预策略,还希望找到最佳可能设计。我们的解决方案(PSOMCS)是使用粒子群优化(PSO)以及从化学计量矩阵直接计算cMCSs,以获得满足多个目标的最优设计。
为了说明PSOMCS的工作原理,我们将其应用于一个简单网络。接下来,我们通过将其性能与中等规模大肠杆菌核心代谢网络上的其他可比方法进行比较,展示其优越性。PSOMCS不仅能找到与先前发表结果相当的解决方案,而且速度快几个数量级。最后,我们使用PSOMCS预测大肠杆菌基因组规模代谢模型中满足多个目标的基因敲除,并将其与OptKnock和RobustKnock进行比较。
与其他当前方法相比,PSOMCS能找到有竞争力的基因敲除策略和设计,并且在某些情况下速度明显更快。它可用于识别能在大型和基因组规模代谢网络中强制实现最优期望行为的基因敲除。随着与工业相关生物体的更大代谢模型的出现,它将更加有用。