Large-scale computation of elementary flux modes with bit pattern trees

MOTIVATION Elementary flux modes (EFMs)--non-decomposable minimal pathways--are commonly accepted tools for metabolic network analysis under steady state conditions. Valid states of the network are linear superpositions of elementary modes shaping a polyhedral cone (the flux cone), which is a well-studied convex set in computational geometry. Computing EFMs is thus basically equivalent to extreme ray enumeration of polyhedral cones. This is a combinatorial problem with poorly scaling algorithms, preventing the large-scale analysis of metabolic networks so far. RESULTS Here, we introduce new algorithmic concepts that enable large-scale computation of EFMs. Distinguishing extreme rays from normal (composite) vectors is one critical aspect of the algorithm. We present a new recursive enumeration strategy with bit pattern trees for adjacent rays--the ancestors of extreme rays--that is roughly one order of magnitude faster than previous methods. Additionally, we introduce a rank updating method that is particularly well suited for parallel computation and a residue arithmetic method for matrix rank computations, which circumvents potential numerical instability problems. Multi-core architectures of modern CPUs can be exploited for further performance improvements. The methods are applied to a central metabolism network of Escherichia coli, resulting in approximately 26 Mio. EFMs. Within the top 2% modes considering biomass production, most of the gain in flux variability is achieved. In addition, we compute approximately 5 Mio. EFMs for the production of non-essential amino acids for a genome-scale metabolic network of Helicobacter pylori. Only large-scale EFM analysis reveals the >85% of modes that generate several amino acids simultaneously. AVAILABILITY An implementation in Java, with integration into MATLAB and support of various input formats, including SBML, is available at http://www.csb.ethz.ch in the tools section; sources are available from the authors upon request.

[1]  Robert Urbanczik,et al.  Functional stoichiometric analysis of metabolic networks , 2005, Bioinform..

[2]  Michel Deza,et al.  Combinatorics and Computer Science , 1996, Lecture Notes in Computer Science.

[3]  B. Palsson,et al.  Genome-scale models of microbial cells: evaluating the consequences of constraints , 2004, Nature Reviews Microbiology.

[4]  Masanori Arita.  The metabolic world of Escherichia coli is not small. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Robert Urbanczik,et al.  The geometry of the flux cone of a metabolic network. , 2005, Biophysical journal.

[6]  Komei Fukuda,et al.  Double Description Method Revisited , 1995, Combinatorics and Computer Science.

[7]  C. Wagner.  Nullspace Approach to Determine the Elementary Modes of Chemical Reaction Systems , 2004 .

[8]  U. Sauer,et al.  Systematic evaluation of objective functions for predicting intracellular fluxes in Escherichia coli , 2007, Molecular systems biology.

[9]  S. Schuster,et al.  Metabolic network structure determines key aspects of functionality and regulation , 2002, Nature.

[10]  G. Church,et al.  Analysis of optimality in natural and perturbed metabolic networks , 2002 .

[11]  Steffen Klamt,et al.  Computation of elementary modes: a unifying framework and the new binary approach , 2004, BMC Bioinformatics.

[12]  Vipul Periwal,et al.  Stoichiometric and Constraint-based Modeling , 2006 .

[13]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[14]  S. Schuster,et al.  ON ELEMENTARY FLUX MODES IN BIOCHEMICAL REACTION SYSTEMS AT STEADY STATE , 1994 .

[15]  S Klamt,et al.  Algorithmic approaches for computing elementary modes in large biochemical reaction networks. , 2005, Systems biology.

[16]  Jason A. Papin,et al.  Determination of redundancy and systems properties of the metabolic network of Helicobacter pylori using genome-scale extreme pathway analysis. , 2002, Genome research.

[17]  H. Raiffa,et al.  3. The Double Description Method , 1953 .

[18]  Jörg Stelling,et al.  Accelerating the Computation of Elementary Modes Using Pattern Trees , 2006, WABI.