• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

MinReact:一种系统的方法,用于识别最小代谢网络。

MinReact: a systematic approach for identifying minimal metabolic networks.

机构信息

Department of Biotechnology, Bhupat Jyoti Mehta School of Biosciences.

Initiative for Biological Systems Engineering (IBSE).

出版信息

Bioinformatics. 2020 Aug 1;36(15):4309-4315. doi: 10.1093/bioinformatics/btaa497.

DOI:10.1093/bioinformatics/btaa497
PMID:32407533
Abstract

MOTIVATION

Genome-scale metabolic models are widely constructed and studied for understanding various design principles underlying metabolism, predominantly redundancy. Metabolic networks are highly redundant and it is possible to minimize the metabolic networks into smaller networks that retain the functionality of the original network.

RESULTS

Here, we establish a new method, MinReact that systematically removes reactions from a given network to identify minimal reactome(s). We show that our method identifies smaller minimal reactomes than existing methods and also scales well to larger metabolic networks. Notably, our method exploits known aspects of network structure and redundancy to identify multiple minimal metabolic networks. We illustrate the utility of MinReact by identifying multiple minimal networks for 77 organisms from the BiGG database. We show that these multiple minimal reactomes arise due to the presence of compensatory reactions/pathways. We further employed MinReact for a case study to identify the minimal reactomes of different organisms in both glucose and xylose minimal environments. Identification of minimal reactomes of these different organisms elucidate that they exhibit varying levels of redundancy. A comparison of the minimal reactomes on glucose and xylose illustrates that the differences in the reactions required to sustain growth on either medium. Overall, our algorithm provides a rapid and reliable way to identify minimal subsets of reactions that are essential for survival, in a systematic manner.

AVAILABILITY AND IMPLEMENTATION

Algorithm is available from https://github.com/RamanLab/MinReact.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

摘要

动机

基因组规模的代谢模型被广泛构建和研究,以了解代谢的各种设计原则,主要是冗余性。代谢网络具有高度的冗余性,因此可以将代谢网络最小化到保留原始网络功能的更小网络中。

结果

在这里,我们建立了一种新的方法 MinReact,该方法可以系统地从给定的网络中删除反应,以识别最小的反应组。我们表明,我们的方法比现有方法识别更小的最小反应组,并且也可以很好地扩展到更大的代谢网络。值得注意的是,我们的方法利用了网络结构和冗余性的已知方面来识别多个最小代谢网络。我们通过从 BiGG 数据库中识别 77 个生物体的多个最小网络来说明 MinReact 的实用性。我们表明,这些多个最小反应组是由于存在补偿反应/途径而产生的。我们进一步将 MinReact 用于案例研究,以确定不同生物体在葡萄糖和木糖最小环境中的最小反应组。不同生物体的最小反应组的鉴定表明,它们表现出不同程度的冗余。对葡萄糖和木糖上最小反应组的比较表明,在任一培养基上维持生长所需的反应存在差异。总的来说,我们的算法提供了一种快速可靠的方法,以系统地识别对于生存至关重要的最小反应子集。

可用性和实现

该算法可从 https://github.com/RamanLab/MinReact 获得。

补充信息

补充数据可在《生物信息学》在线获得。

相似文献

1
MinReact: a systematic approach for identifying minimal metabolic networks.MinReact:一种系统的方法,用于识别最小代谢网络。
Bioinformatics. 2020 Aug 1;36(15):4309-4315. doi: 10.1093/bioinformatics/btaa497.
2
Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection.通过通量锥投影计算基因组规模代谢网络中的不可逆转最小割集。
Bioinformatics. 2019 Aug 1;35(15):2618-2625. doi: 10.1093/bioinformatics/bty1027.
3
MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks.MCS2:代谢网络中最小割集快速枚举的最小协调支持。
Bioinformatics. 2019 Jul 15;35(14):i615-i623. doi: 10.1093/bioinformatics/btz393.
4
Understanding the evolution of functional redundancy in metabolic networks.理解代谢网络中功能冗余的进化。
Bioinformatics. 2018 Sep 1;34(17):i981-i987. doi: 10.1093/bioinformatics/bty604.
5
Fast-SL: an efficient algorithm to identify synthetic lethal sets in metabolic networks.Fast-SL:一种在代谢网络中识别合成致死集的有效算法。
Bioinformatics. 2015 Oct 15;31(20):3299-305. doi: 10.1093/bioinformatics/btv352. Epub 2015 Jun 17.
6
Exact quantification of cellular robustness in genome-scale metabolic networks.基因组规模代谢网络中细胞鲁棒性的精确量化。
Bioinformatics. 2016 Mar 1;32(5):730-7. doi: 10.1093/bioinformatics/btv649. Epub 2015 Nov 4.
7
Enumerating all possible biosynthetic pathways in metabolic networks.列举代谢网络中所有可能的生物合成途径。
Sci Rep. 2018 Jul 2;8(1):9932. doi: 10.1038/s41598-018-28007-7.
8
gMCS: fast computation of genetic minimal cut sets in large networks.gMCS:在大型网络中快速计算遗传最小割集。
Bioinformatics. 2019 Feb 1;35(3):535-537. doi: 10.1093/bioinformatics/bty656.
9
Predicting novel metabolic pathways through subgraph mining.通过子图挖掘预测新的代谢途径。
Bioinformatics. 2017 Dec 15;33(24):3955-3963. doi: 10.1093/bioinformatics/btx481.
10
Computational Prediction of Synthetic Lethals in Genome-Scale Metabolic Models Using Fast-SL.使用Fast-SL在基因组规模代谢模型中进行合成致死的计算预测。
Methods Mol Biol. 2018;1716:315-336. doi: 10.1007/978-1-4939-7528-0_14.

引用本文的文献

1
Designing function-specific minimal microbiomes from large microbial communities.从大型微生物群落中设计功能特定的最小微生物群。
NPJ Syst Biol Appl. 2024 May 3;10(1):46. doi: 10.1038/s41540-024-00373-1.
2
A structural property for reduction of biochemical networks.生化网络还原的结构性质。
Sci Rep. 2021 Aug 31;11(1):17415. doi: 10.1038/s41598-021-96835-1.