ecmtool: fast and memory-efficient enumeration of elementary conversion modes

被引:2
|
作者
Buchner, Bianca [1 ]
Clement, Tom J. [2 ]
de Groot, Daan H. [3 ]
Zanghellini, Juergen [4 ]
机构
[1] acib GmbH, Austrian Ctr Ind Biotechnol, A-1190 Vienna, Austria
[2] Vrije Univ, Syst Biol Lab, NL-1081 HV Amsterdam, Netherlands
[3] Univ Basel, Swiss Inst Bioinformat, Biozentrum, CH-4056 Basel, Switzerland
[4] Univ Vienna, Dept Analyt Chem, A-1090 Vienna, Austria
关键词
D O I
10.1093/bioinformatics/btad095
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Characterizing all steady-state flux distributions in metabolic models remains limited to small models due to the explosion of possibilities. Often it is sufficient to look only at all possible overall conversions a cell can catalyze ignoring the details of intracellular metabolism. Such a characterization is achieved by elementary conversion modes (ECMs), which can be conveniently computed with ecmtool. However, currently, ecmtool is memory intensive, and it cannot be aided appreciably by parallelization.Results: We integrate mplrs-a scalable parallel vertex enumeration method-into ecmtool. This speeds up computation, drastically reduces memory requirements and enables ecmtool's use in standard and high-performance computing environments. We show the new capabilities by enumerating all feasible ECMs of the near-complete metabolic model of the minimal cell JCVI-syn3.0. Despite the cell's minimal character, the model gives rise to 4.2x10(9) ECMs and still contains several redundant sub-networks.
引用
收藏
页数:2
相关论文
共 50 条
  • [1] Memory-efficient and fast enumeration of global states
    Andrzejak, A
    SEVENTH INTERNATIONAL CONFERENCE ON INFORMATION VISUALIZATION, PROCEEDINGS, 2003, : 189 - 193
  • [2] Unlocking Elementary Conversion Modes: ecmtool Unveils All Capabilities of Metabolic Networks
    Clement, Tom J.
    Baalhuis, Erik B.
    Teusink, Bas
    Bruggeman, Frank J.
    Planque, Robert
    de Groot, Daan H.
    PATTERNS, 2021, 2 (01):
  • [3] Memory-efficient enumeration of constrained spanning trees
    Nievergelt, J
    Deo, N
    Marzetta, A
    INFORMATION PROCESSING LETTERS, 1999, 72 (1-2) : 47 - 53
  • [4] Fast, memory-efficient retrograde algorithms
    Wu, R
    Beal, D
    ICGA JOURNAL, 2001, 24 (03) : 147 - 159
  • [5] Fast, Memory-Efficient Construction of Voxelized Shadows
    Kampe, Viktor
    Sintorn, Erik
    Assarsson, Ulf
    PROCEEDINGS - I3D 2015, 2015, : 25 - 30
  • [6] Fast, Memory-Efficient Construction of Voxelized Shadows
    Kampe, Viktor
    Sintorn, Erik
    Dolonius, Dan
    Assarsson, Ulf
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2016, 22 (10) : 2239 - 2248
  • [7] Memory-efficient state lookups with fast updates
    Sikka, S
    Varghese, G
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2000, 30 (04) : 335 - 347
  • [8] On Fast and Memory-Efficient Construction of an Antidictionary Array
    Fukae, Hirotada
    Ota, Takahiro
    Morita, Hiroyoshi
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [9] Fast and Memory-Efficient Algorithms for Evacuation Problems
    Schloeter, Miriam
    Skutella, Martin
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 821 - 840
  • [10] Fast and memory-efficient minimum spanning tree on the
    Rostrup, Scott
    Srivastava, Shweta
    Singhal, Kishore
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2013, 8 (01) : 21 - 33