首页> 外文会议>Asia-Pacific Bioinformatics Conference >Adaptive bi-level programming for optimal gene knockouts for targeted overproduction under phenotypic constraints
【24h】

Adaptive bi-level programming for optimal gene knockouts for targeted overproduction under phenotypic constraints

机译:在表型限制下,针对目标过度生产的最佳基因敲除的自适应双级规划

获取原文

摘要

Background: Optimization procedures to identify gene knockouts for targeted biochemical overproduction have been widely in use in modern metabolic engineering. Flux balance analysis (FBA) framework has provided conceptual simplifications for genome-scale dynamic analysis at steady states. Based on FBA, many current optimization methods for targeted bio-productions have been developed under the maximum cell growth assumption. The optimization problem to derive gene knockout strategies recently has been formulated as a bi-level programming problem in OptKnock for maximum targeted bio-productions with maximum growth rates. However, it has been shown that knockout mutants in fact reach the steady states with the minimization of metabolic adjustment (MOMA) from the corresponding wild-type strains instead of having maximal growth rates after genetic or metabolic intervention. In this work, we propose a new bi-level computational framework-MOMAKnock-which can derive robust knockout strategies under the MOMA flux distribution approximation.Methods: In this new bi-level optimization framework, we aim to maximize the production of targeted chemicals by identifying candidate knockout genes or reactions under phenotypic constraints approximated by the MOMA assumption. Hence, the targeted chemical production is the primary objective of MOMAKnock while the MOMA assumption is formulated as the inner problem of constraining the knockout metabolic flux to be as close as possible to the steady-state phenotypes of wide-type strains. As this new inner problem becomes a quadratic programming problem, a novel adaptive piecewise linearization algorithm is developed in this paper to obtain the exact optimal solution to this new bi-level integer quadratic programming problem for MOMAKnock.Results: Our new MOMAKnock model and the adaptive piecewise linearization solution algorithm are tested with a small E. coli core metabolic network and a large-scale iAFI 260 E. coli metabolic network. The derived knockout strategies are compared with those from OptKnock. Our preliminary experimental results show that MOMAKnock can provide improved targeted productions with more robust knockout strategies.
机译:背景:优化程序,以识别基因敲除进行有针对性的生化生产过剩已经在现代代谢工程使用了广泛。通量平衡分析(FBA)框架在稳定状态提供了用于基因组范围动态分析概念简化。基于FBA,进行有针对性的生物生产许多当前的优化方法已经被下的最大细胞生长的假设开发的。最优化问题推导基因敲除的策略最近已经制定为OptKnock为最大目标的生物生产与最大生长速率的双层规划问题。然而,已经表明,事实上敲除突变体与来自相应的野生型菌株代替具有遗传性或代谢干预后最大生长速率代谢调节(MOMA)的最小化达到稳定的状态。在这项工作中,我们提出了一个新的双水平计算框架,MOMAKnock,它可以根据MOMA通量分布approximation.Methods获得强大的淘汰赛策略:在这个新的双级优化框架,我们的目标是最大限度地提高生产目标化学品识别候选敲除下由MOMA假设近似表型约束基因或反应。因此,目标化学生产MOMAKnock的主要目的而假设MOMA配制成约束淘汰赛代谢通量为尽可能接近到的宽型菌株的稳态表型的内问题。由于这种新的内层问题成为二次规划问题,一种新颖的自适应分段线性化算法在本文显影以获得精确的最优解到这个新的双水平整数二次规划问题为MOMAKnock.Results:我们的新MOMAKnock模型和自适应分段线性化溶液算法具有小的大肠杆菌核心代谢网络和一个大规模IAFI 260大肠杆菌代谢网络测试。派生淘汰赛策略与那些从OptKnock比较。我们的初步实验结果表明,MOMAKnock可提供改进的具有更强大的淘汰赛战略的目标制作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号