首页> 外文会议>European symposium on computer aided process engineering;ESCAPE 21 >Graph Theory Augmented Recursive MILP Approach for Identifying Multiple Minimal Reaction Sets in Metabolic Networks
【24h】

Graph Theory Augmented Recursive MILP Approach for Identifying Multiple Minimal Reaction Sets in Metabolic Networks

机译:图论增强递推式MILP方法用于识别代谢网络中的多个最小反应集

获取原文

摘要

Development of cells with minimal functionality, containing only desired catalytic properties for chemical conversion and replication, are gaining importance since such minimal cells are expected to be the most efficient machinery for production of specific chemicals. In this paper, we propose a graph theory augmented recursive MILP approach to identify multiple minimal reaction sets in metabolic networks that are capable of satisfying predefined objectives (such as growth). The proposed approach uses graph theoretic insights to reduce computational time and a recursive MILP approach to identify multiple minimal reaction sets. Identifying such multiple minimal reaction sets facilitates development of best minimal cell based on other process requirements. The proposed approach is illustrated by identifying multiple minimal reaction sets that can produce predefined biomass in E.coli.
机译:具有最小功能性的细胞的开发正变得越来越重要,因为仅包含所需的化学转化和复制所需的催化特性,因为这种最小的细胞有望成为生产特定化学品的最有效的机械。在本文中,我们提出了一种图论增强的递归MILP方法,以识别能够满足预定目标(例如增长)的代谢网络中的多个最小反应集。所提出的方法使用图论的见解来减少计算时间,并使用递归的MILP方法来识别多个最小反应集。识别多个最小反应集有助于根据其他过程要求开发最佳最小电池。通过确定可以在大肠杆菌中产生预定义生物量的多个最小反应集来说明所提出的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号