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 条
  • [21] A Fast and Memory-Efficient Approach to NDN Name Lookup
    Dacheng He
    Dafang Zhang
    Ke Xu
    Kun Huang
    Yanbiao Li
    中国通信, 2017, 14 (10) : 61 - 69
  • [22] Fast and Memory-Efficient Import Vector Domain Description
    Sergio Decherchi
    Andrea Cavalli
    Neural Processing Letters, 2020, 52 : 511 - 524
  • [23] A fast and memory-efficient hierarchical graph clustering algorithm
    Szilágyi, László
    Szilágyi, Sándor Miklós
    Hirsbrunner, Béat
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8834 : 247 - 254
  • [24] Fast, memory-efficient traffic estimation by coincidence counting
    Hao, F
    Kodialam, M
    Lakshman, TV
    Zhang, H
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 2080 - 2090
  • [25] A memory-efficient scheme for fast spectral photon mapping
    Ikeda, Kosuke
    Takizawa, Hiroyuki
    Kobayashi, Hiroaki
    PROCEEDINGS OF THE NINTH IASTED INTERNATIONAL CONFERENCE ON COMPUTER GRAPHICS AND IMAGING, 2007, : 75 - 80
  • [26] Memory-efficient w-projection with the fast Gauss transform
    Bannister, K. W.
    Cornwell, T. J.
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2013, 430 (03) : 2390 - 2400
  • [27] Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs
    Manzoor, Emaad
    Milajerdi, Sadegh M.
    Akoglu, Leman
    KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 1035 - 1044
  • [28] FLARE: A Fast, Secure, and Memory-Efficient Distributed Analytics Framework
    Li, Xiang
    Li, Fabing
    Gao, Mingyu
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 16 (06): : 1439 - 1452
  • [29] Fast and Memory-Efficient Voronoi Diagram Construction on Triangle Meshes
    Qin, Yipeng
    Yu, Hongchuan
    Zhang, Jianjun
    COMPUTER GRAPHICS FORUM, 2017, 36 (05) : 93 - 104
  • [30] Fast, Memory-Efficient Cell Location in Unstructured Grids for Visualization
    Garth, Christoph
    Joy, Kenneth I.
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2010, 16 (06) : 1541 - 1550