首页> 外文会议>International Symposium on Computational Life Science >Minimal Direction Cuts in Metabolic Networks
【24h】

Minimal Direction Cuts in Metabolic Networks

机译:最小的方向切割代谢网络

获取原文

摘要

Minimal cut sets (MCSs) have been introduced to define perturbations in a metabolic network needed to repress the activity of a given target reaction. While this approach gives interesting insight into the structure of metabolic networks, it suffers from two major drawbacks that are limiting in practice. First, using MCSs becomes inadequate when we are interested in inhibiting only one direction of a reversible target reaction. Second, and more importantly, the computation of MCSs by currently available methods is limited by the combinatorial explosion of the number of elementary modes and hence is not practical for genomescale networks. To overcome these problems, we introduce the concept of minimal direction cuts. A minimal forward (resp. backward) direction cut (MFC) (resp. MBC) is a minimal set of reactions whose removal prevents the target reaction from carrying a flux in the forward (resp. backward) direction. Computing MFCs and MBCs does not require to determine beforehand the elementary modes of the network. Instead it can be based on the Farkas lemma for equality and inequality constraints. This leads to a new algorithm to identify minimal direction cuts, which can also be used for a direct computation of MCSs.
机译:已经引入最小切割(MCS)以在压制给定目标反应的活性所需的代谢网络中定义扰动。虽然这种方法对代谢网络的结构具有有趣的洞察力,但它受到了在实践中限制的两个主要缺点。首先,当我们有兴趣仅抑制可逆目标反应的一个方向时,使用MCS就变得不足。其次,更重要的是,目前可用方法计算MCSS的计算受到基本模式数量的组合爆炸的限制,因此对于GenomScale网络并不实用。为了克服这些问题,我们介绍了最小的方向削减的概念。最小的前向(反向)方向切割(MFC)(RESP.MBC)是一种最小一组反应,其去除防止目标反应在前向(RESP.向后)方向上携带助焊剂。计算MFC和MBCS不需要预先确定网络的基本模式。相反,它可以基于Farkas Lemma进行平等和不等式约束。这导致了一种新的算法来识别最小的方向切割,这也可以用于MCS的直接计算。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号