Fast Flux Module Detection Using Matroid Theory

被引:0
|
作者
Mueller, Arne C. [1 ,2 ,3 ]
Bruggeman, Frank J. [8 ]
Olivier, Brett G. [5 ,7 ]
Stougie, Leen [4 ,6 ]
机构
[1] Free Univ Berlin, Dept Math & Comp Sci, Arnimallee 6, D-14195 Berlin, Germany
[2] Max Planck Inst Mol Genet, IMPRS CBSC, Ihnestr 73, D-14195 Berlin, Germany
[3] Berlin Math Sch BMS, Berlin, Germany
[4] Ctr Math & Comp Sci CWI, NL-1098 XG Amsterdam, Netherlands
[5] Vrije Univ Amsterdam, Mol Cell Physiol, De Boelelaan 1085, NL-1081 HV Amsterdam, Netherlands
[6] Vrije Univ Amsterdam, Operat Res, De Boelelaan 1085, NL-1081 HV Amsterdam, Netherlands
[7] Netherlands Inst Syst Biol, Amsterdam, Netherlands
[8] Vrije Univ Amsterdam, Syst Bioinformat, De Boelelaan 1085, NL-1081 HV Amsterdam, Netherlands
关键词
metabolic networks; FBA; flux modules; matroid theory; SCALE METABOLIC MODELS; BALANCE ANALYSIS; SUBNETWORKS; CONSTRAINTS; NETWORKS; GRAPH;
D O I
暂无
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Flux balance analysis (FBA) is one of the most often applied methods on genome-scale metabolic networks. Although FBA uniquely determines the optimal yield, the pathway that achieves this is usually not unique. The analysis of the optimal-yield flux space has been an open challenge. Flux variability analysis is only capturing some properties of the flux space, while elementary mode analysis is intractable due to the enormous number of elementary modes. However, it has been found by Kelk et al. 2012, that the space of optimal-yield fluxes decomposes into flux modules. These decompositions allow a much easier but still comprehensive analysis of the optimal-yield flux space. Using the mathematical definition of module introduced by Muller and Bockmayr 2013, we discovered that flux modularity is rather a local than a global property which opened connections to matroid theory. Specifically, we show that our modules correspond one-to-one to so-called separators of an appropriate matroid. Employing efficient algorithms developed in matroid theory we are now able to compute the decomposition into modules in a few seconds for genome-scale networks. Using that every module can be represented by one reaction that represents its function, in this paper, we also present a method that uses this decomposition to visualize the interplay of modules. We expect the new method to replace flux variability analysis in the pipelines for metabolic networks.
引用
收藏
页码:192 / 206
页数:15
相关论文
共 50 条
  • [31] Is there a matroid theory of signed graph embedding?
    Zaslavsky, T
    ARS COMBINATORIA, 1997, 45 : 129 - 141
  • [32] A note on geometric duality in matroid theory and knot theory
    Traldi, Lorenzo
    DISCRETE APPLIED MATHEMATICS, 2022, 320 : 184 - 190
  • [34] Matroid theory and Chern-Simons
    Nieto, JA
    Marín, MC
    JOURNAL OF MATHEMATICAL PHYSICS, 2000, 41 (12) : 7997 - 8005
  • [35] Recent work in matroid representation theory
    Whittle, G
    DISCRETE MATHEMATICS, 2005, 302 (1-3) : 285 - 296
  • [36] Formulistic Detection of Malicious Fast-Flux Domains
    Chen, Chia-Mei
    Cheng, Sheng-Tzong
    Chou, Ju-Hsien
    Ou, Ya-Hui
    2012 FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), 2012, : 72 - 79
  • [37] Fast-Flux Bot Detection in Real Time
    Hsu, Ching-Hsiang
    Huang, Chun-Ying
    Chen, Kuan-Ta
    RECENT ADVANCES IN INTRUSION DETECTION, 2010, 6307 : 464 - +
  • [38] PASSVM: A highly accurate fast flux detection system
    Al-Duwairi, Basheer
    Jarrah, Moath
    Shatnawi, Ahmed S.
    COMPUTERS & SECURITY, 2021, 110 (110)
  • [39] A fast and robust face detection based on module switching network
    Kim, JB
    Sung, YH
    Kee, SC
    SIXTH IEEE INTERNATIONAL CONFERENCE ON AUTOMATIC FACE AND GESTURE RECOGNITION, PROCEEDINGS, 2004, : 409 - 414
  • [40] INVESTIGATION OF FAILED FUEL DETECTION AND LOCATION USING A FLUX TILTING METHOD IN A FAST BREEDER REACTOR
    HAMADA, M
    UEHARA, K
    MURAMATSU, K
    KAMEI, T
    TAMAOKI, T
    YAMAOKA, M
    SONODA, Y
    SANO, Y
    SATO, M
    SUDO, T
    NUCLEAR TECHNOLOGY, 1992, 98 (01) : 1 - 13