Nullspace Approach to Determine the Elementary Modes of Chemical Reaction Systems

A system architecture for parallel analysis of flux-balanced metabolic pathways

Elementary flux mode (EFM) analysis is a well-studied method in constraint-based modeling of metabolic networks. In EFM analysis, a network is decomposed into minimal functional pathways based on the assumption of balanced metabolic fluxes. In this paper, a system architecture is proposed that approximately models the functionality of metabolic networks. The AND/OR graph model is used to represent the metabolic network and each processing element in the system emulates the functionality of a metabolite. The system is implemented on a graphics processing unit (GPU) as the hardware platform using CUDA environment. The proposed architecture takes advantage of the inherent parallelism in the network structure in terms of both pathway and metabolite traversal. The function of each element is defined such that it can find flux-balanced pathways. Pathways in both small and large metabolic networks are applied to the proposed architecture and the results are discussed.

MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks

Motivation

Constraint-based modeling of metabolic networks helps researchers gain insight into the metabolic processes of many organisms, both prokaryotic and eukaryotic. Minimal cut sets (MCSs) are minimal sets of reactions whose inhibition blocks a target reaction in a metabolic network. Most approaches for finding the MCSs in constrained-based models require, either as an intermediate step or as a byproduct of the calculation, the computation of the set of elementary flux modes (EFMs), a convex basis for the valid flux vectors in the network. Recently, Ballerstein et al. proposed a method for computing the MCSs of a network without first computing its EFMs, by creating a dual network whose EFMs are a superset of the MCSs of the original network. However, their dual network is always larger than the original network and depends on the target reaction. Here we propose the construction of a different dual network, which is typically smaller than the original network and is independent of the target reaction, for the same purpose. We prove the correctness of our approach, minimal coordinated support (MCS²), and describe how it can be modified to compute the few smallest MCSs for a given target reaction.

Results

We compare MCS² to the method of Ballerstein et al. and two other existing methods. We show that MCS² succeeds in calculating the full set of MCSs in many models where other approaches cannot finish within a reasonable amount of time. Thus, in addition to its theoretical novelty, our approach provides a practical advantage over existing methods.

Availability and implementation

MCS² is freely available at https://github.com/RezaMash/MCS under the GNU 3.0 license.

Supplementary information

Supplementary data are available at Bioinformatics online.

Towards scaling elementary flux mode computation

While elementary flux mode (EFM) analysis is now recognized as a cornerstone computational technique for cellular pathway analysis and engineering, EFM application to genome-scale models remains computationally prohibitive. This article provides a review of aspects of EFM computation that elucidates bottlenecks in scaling EFM computation. First, algorithms for computing EFMs are reviewed. Next, the impact of redundant constraints, sensitivity to constraint ordering and network compression are evaluated. Then, the advantages and limitations of recent parallelization and GPU-based efforts are highlighted. The article then reviews alternative pathway analysis approaches that aim to reduce the EFM solution space. Despite advances in EFM computation, our review concludes that continued scaling of EFM computation is necessary to apply EFM to genome-scale models. Further, our review concludes that pathway analysis methods that target specific pathway properties can provide powerful alternatives to EFM analysis.

Thermodynamic constraints for identifying elementary flux modes

Metabolic pathway analysis is a key method to study metabolism and the elementary flux modes (EFMs) is one major concept allowing one to analyze the network in terms of minimal pathways. Their practical use has been hampered by the combinatorial explosion of their number in large systems. The EFMs give the possible pathways at steady state, but the real pathways are limited by biological constraints. In this review, we display three different methods that integrate thermodynamic constraints in terms of Gibbs free energy in the EFMs computation.

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

Motivation

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP).

Results

Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

Availability and Implementation

The software is implemented in Matlab, and is provided as supplementary information .

Contact

hyunseob.song@pnnl.gov.

Supplementary information

Supplementary data are available at Bioinformatics online.

A graph-based approach to analyze flux-balanced pathways in metabolic networks

An elementary flux mode (EFM) is a pathway with minimum set of reactions that are functional in steady-state constrained space. Due to the high computational complexity of calculating EFMs, different approaches have been proposed to find these flux-balanced pathways. In this paper, an approach to find a subset of EFMs is proposed based on a graph data model. The given metabolic network is mapped to the graph model and decisions for reaction inclusion can be made based on metabolites and their associated reactions. This notion makes the approach more convenient to categorize the output pathways. Implications of the proposed method on metabolic networks are discussed.

Mathematical modelling of clostridial acetone-butanol-ethanol fermentation

Clostridial acetone-butanol-ethanol (ABE) fermentation features a remarkable shift in the cellular metabolic activity from acid formation, acidogenesis, to the production of industrial-relevant solvents, solventogensis. In recent decades, mathematical models have been employed to elucidate the complex interlinked regulation and conditions that determine these two distinct metabolic states and govern the transition between them. In this review, we discuss these models with a focus on the mechanisms controlling intra- and extracellular changes between acidogenesis and solventogenesis. In particular, we critically evaluate underlying model assumptions and predictions in the light of current experimental knowledge. Towards this end, we briefly introduce key ideas and assumptions applied in the discussed modelling approaches, but waive a comprehensive mathematical presentation. We distinguish between structural and dynamical models, which will be discussed in their chronological order to illustrate how new biological information facilitates the ‘evolution’ of mathematical models. Mathematical models and their analysis have significantly contributed to our knowledge of ABE fermentation and the underlying regulatory network which spans all levels of biological organization. However, the ties between the different levels of cellular regulation are not well understood. Furthermore, contradictory experimental and theoretical results challenge our current notion of ABE metabolic network structure. Thus, clostridial ABE fermentation still poses theoretical as well as experimental challenges which are best approached in close collaboration between modellers and experimentalists.

gEFM: An Algorithm for Computing Elementary Flux Modes Using Graph Traversal

Computational methods to engineer cellular metabolism promise to play a critical role in producing pharmaceutical, repairing defective genes, destroying cancer cells, and generating biofuels. Elementary Flux Mode (EFM) analysis is one such powerful technique that has elucidated cell growth and regulation, predicted product yield, and analyzed network robustness. EFM analysis, however, is a computationally daunting task because it requires the enumeration of all independent and stoichiometrically balanced pathways within a cellular network. We present in this paper an EFM enumeration algorithm, termed graphical EFM or gEFM. The algorithm is based on graph traversal, an approach previously assumed unsuitable for enumerating EFMs. The approach is derived from a pathway synthesis method proposed by Mavrovouniotis et al. The algorithm is described and proved correct. We apply gEFM to several networks and report runtimes in comparison with other EFM computation tools. We show how gEFM benefits from network compression. Like other EFM computational techniques, gEFM is sensitive to constraint ordering; however, we are able to demonstrate that knowledge of the underlying network structure leads to better constraint ordering. gEFM is shown to be competitive with state-of-the-art EFM computational techniques for several networks, but less so for networks with a larger number of EFMs.

Exploiting stoichiometric redundancies for computational efficiency and network reduction

Analysis of metabolic networks typically begins with construction of the stoichiometry matrix, which characterizes the network topology. This matrix provides, via the balance equation, a description of the potential steady-state flow distribution. This paper begins with the observation that the balance equation depends only on the structure of linear redundancies in the network, and so can be stated in a succinct manner, leading to computational efficiencies in steady-state analysis. This alternative description of steady-state behaviour is then used to provide a novel method for network reduction, which complements existing algorithms for describing intracellular networks in terms of input-output macro-reactions (to facilitate bioprocess optimization and control). Finally, it is demonstrated that this novel reduction method can be used to address elementary mode analysis of large networks: the modes supported by a reduced network can capture the input-output modes of a metabolic module with significantly reduced computational effort.

A depth-first search algorithm to compute elementary flux modes by linear programming

Background

The decomposition of complex metabolic networks into elementary flux modes (EFMs) provides a useful framework for exploring reaction interactions systematically. Generating a complete set of EFMs for large-scale models, however, is near impossible. Even for moderately-sized models (<400 reactions), existing approaches based on the Double Description method must iterate through a large number of combinatorial candidates, thus imposing an immense processor and memory demand.

Results

Based on an alternative elementarity test, we developed a depth-first search algorithm using linear programming (LP) to enumerate EFMs in an exhaustive fashion. Constraints can be introduced to directly generate a subset of EFMs satisfying the set of constraints. The depth-first search algorithm has a constant memory overhead. Using flux constraints, a large LP problem can be massively divided and parallelized into independent sub-jobs for deployment into computing clusters. Since the sub-jobs do not overlap, the approach scales to utilize all available computing nodes with minimal coordination overhead or memory limitations.

Conclusions

The speed of the algorithm was comparable to efmtool, a mainstream Double Description method, when enumerating all EFMs; the attrition power gained from performing flux feasibility tests offsets the increased computational demand of running an LP solver. Unlike the Double Description method, the algorithm enables accelerated enumeration of all EFMs satisfying a set of constraints.

Metabolic analysis of Chlorobium chlorochromatii CaD3 reveals clues of the symbiosis in 'Chlorochromatium aggregatum'

A symbiotic association occurs in 'Chlorochromatium aggregatum', a phototrophic consortium integrated by two species of phylogenetically distant bacteria composed by the green-sulfur Chlorobium chlorochromatii CaD3 epibiont that surrounds a central β-proteobacterium. The non-motile chlorobia can perform nitrogen and carbon fixation, using sulfide as electron donors for anoxygenic photosynthesis. The consortium can move due to the flagella present in the central β-protobacterium. Although Chl. chlorochromatii CaD3 is never found as free-living bacteria in nature, previous transcriptomic and proteomic studies have revealed that there are differential transcription patterns between the symbiotic and free-living status of Chl. chlorocromatii CaD3 when grown in laboratory conditions. The differences occur mainly in genes encoding the enzymatic reactions involved in nitrogen and amino acid metabolism. We performed a metabolic reconstruction of Chl. chlorochromatii CaD3 and an in silico analysis of its amino acid metabolism using an elementary flux modes approach (EFM). Our study suggests that in symbiosis, Chl. chlorochromatii CaD3 is under limited nitrogen conditions where the GS/GOGAT (glutamine synthetase/glutamate synthetase) pathway is actively assimilating ammonia obtained via N2 fixation. In contrast, when free-living, Chl. chlorochromatii CaD3 is in a condition of nitrogen excess and ammonia is assimilated by the alanine dehydrogenase (AlaDH) pathway. We postulate that 'Chlorochromatium aggregatum' originated from a parasitic interaction where the N2 fixation capacity of the chlorobia would be enhanced by injection of 2-oxoglutarate from the β-proteobacterium via the periplasm. This consortium would have the advantage of motility, which is fundamental to a phototrophic bacterium, and the syntrophy of nitrogen and carbon sources.

On functional module detection in metabolic networks

Functional modules of metabolic networks are essential for understanding the metabolism of an organism as a whole. With the vast amount of experimental data and the construction of complex and large-scale, often genome-wide, models, the computer-aided identification of functional modules becomes more and more important. Since steady states play a key role in biology, many methods have been developed in that context, for example, elementary flux modes, extreme pathways, transition invariants and place invariants. Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules. A prominent and currently intensively discussed field of methods in graph theory addresses the Q-modularity. In this paper, we recall known concepts of module detection based on the steady-state assumption, focusing on transition-invariants (elementary modes) and their computation as minimal solutions of systems of Diophantine equations. We present the Fourier-Motzkin algorithm in detail. Afterwards, we introduce the Q-modularity as an example for a useful non-steady-state method and its application to metabolic networks. To illustrate and discuss the concepts of invariants and Q-modularity, we apply a part of the central carbon metabolism in potato tubers (Solanum tuberosum) as running example. The intention of the paper is to give a compact presentation of known steady-state concepts from a graph-theoretical viewpoint in the context of network decomposition and reduction and to introduce the application of Q-modularity to metabolic Petri net models.

Reduction techniques for network validation in systems biology

The rapidly increasing amount of experimental biological data enables the development of large and complex, often genome-scale models of molecular systems. The simulation and analysis of these computer models of metabolism, signal transduction, and gene regulation are standard applications in systems biology, but size and complexity of the networks limit the feasibility of many methods. Reduction of networks provides a hierarchical view of complex networks and gives insight knowledge into their coarse-grained structural properties. Although network reduction has been extensively studied in computer science, adaptation and exploration of these concepts are still lacking for the analysis of biochemical reaction systems. Using the Petri net formalism, we describe two local network structures, common transition pairs and minimal transition invariants. We apply these two structural elements for network reduction. The reduction preserves the CTI-property (covered by transition invariants), which is an important feature for completeness of biological models. We demonstrate this concept for a selection of metabolic networks including a benchmark network of Saccharomyces cerevisiae whose straightforward treatment is not yet feasible even on modern supercomputers.

Analysis of metabolic subnetworks by flux cone projection

Background

Analysis of elementary modes (EMs) is proven to be a powerful constraint-based method in the study of metabolic networks. However, enumeration of EMs is a hard computational task. Additionally, due to their large number, EMs cannot be simply used as an input for subsequent analysis. One possibility is to limit the analysis to a subset of interesting reactions. However, analysing an isolated subnetwork can result in finding incorrect EMs which are not part of any steady-state flux distribution of the original network. The ideal set to describe the reaction activity in a subnetwork would be the set of all EMs projected to the reactions of interest. Recently, the concept of "elementary flux patterns" (EFPs) has been proposed. Each EFP is a subset of the support (i.e., non-zero elements) of at least one EM.

Results

We introduce the concept of ProCEMs (Projected Cone Elementary Modes). The ProCEM set can be computed by projecting the flux cone onto a lower-dimensional subspace and enumerating the extreme rays of the projected cone. In contrast to EFPs, ProCEMs are not merely a set of reactions, but projected EMs. We additionally prove that the set of EFPs is included in the set of ProCEM supports. Finally, ProCEMs and EFPs are compared for studying substructures of biological networks.

Conclusions

We introduce the concept of ProCEMs and recommend its use for the analysis of substructures of metabolic networks for which the set of EMs cannot be computed.

Projection to latent pathways (PLP): a constrained projection to latent variables (PLS) method for elementary flux modes discrimination

Background

Elementary flux modes (EFM) are unique and non-decomposable sets of metabolic reactions able to operate coherently in steady-state. A metabolic network has in general a very high number of EFM reflecting the typical functional redundancy of biological systems. However, most of these EFM are either thermodynamically unfeasible or inactive at pre-set environmental conditions.

Results

Here we present a new algorithm that discriminates the "active" set of EFM on the basis of dynamic envirome data. The algorithm merges together two well-known methods: projection to latent structures (PLS) and EFM analysis, and is therefore termed projection to latent pathways (PLP). PLP has two concomitant goals: (1) maximisation of correlation between EFM weighting factors and measured envirome data and (2) minimisation of redundancy by eliminating EFM with low correlation with the envirome.

Conclusions

Overall, our results demonstrate that PLP slightly outperforms PLS in terms of predictive power. But more importantly, PLP is able to discriminate the subset of EFM with highest correlation with the envirome, thus providing in-depth knowledge of how the environment controls core cellular functions. This offers a significant advantage over PLS since its abstract structure cannot be associated with the underlying biological structure.

Decomposing flux distributions into elementary flux modes in genome-scale metabolic networks

MOTIVATION

Elementary flux mode (EFM) is a fundamental concept as well as a useful tool in metabolic pathway analysis. One important role of EFMs is that every flux distribution can be decomposed into a set of EFMs and a number of methods to study flux distributions originated from it. Yet finding such decompositions requires the complete set of EFMs, which is intractable in genome-scale metabolic networks due to combinatorial explosion.

RESULTS

In this article, we proposed an algorithm to decompose flux distributions into EFMs in genome-scale networks. It is an iterative scheme of a mixed integer linear program. Unlike previous optimization models to find pathways, any feasible solutions can become EFMs in our algorithm. This advantage enables the algorithm to approximate the EFM of largest contribution to an objective reaction in a flux distribution. Our algorithm is able to find EFMs of flux distributions with complex structures, closer to the realistic case in which a cell is subject to various constraints. A case of Escherichia coli growth in the Lysogeny broth (LB) medium containing various carbon sources was studied. Essential metabolites and their syntheses were located. Information on the contribution of each carbon source not obvious from the apparent flux distribution was also revealed. Our work further confirms the utility of finding EFMs by optimization models in genome-scale metabolic networks.

CONTACT

joshua.chan@connect.polyu.hk

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Cell functional enviromics: unravelling the function of environmental factors

Background

While functional genomics, focused on gene functions and gene-gene interactions, has become a very active field of research in molecular biology, equivalent methodologies embracing the environment and gene-environment interactions are relatively less developed. Understanding the function of environmental factors is, however, of paramount importance given the complex, interactive nature of environmental and genetic factors across multiple time scales.

Results

Here, we propose a systems biology framework, where the function of environmental factors is set at its core. We set forth a "reverse" functional analysis approach, whereby cellular functions are reconstructed from the analysis of dynamic envirome data. Our results show these data sets can be mapped to less than 20 core cellular functions in a typical mammalian cell culture, while explaining over 90% of flux data variance. A functional enviromics map can be created, which provides a template for manipulating the environmental factors to induce a desired phenotypic trait.

Conclusion

Our results support the feasibility of cellular function reconstruction guided by the analysis and manipulation of dynamic envirome data.

Parallelization of Nullspace Algorithm for the computation of metabolic pathways

Elementary mode analysis is a useful metabolic pathway analysis tool in understanding and analyzing cellular metabolism, since elementary modes can represent metabolic pathways with unique and minimal sets of enzyme-catalyzed reactions of a metabolic network under steady state conditions. However, computation of the elementary modes of a genome- scale metabolic network with 100-1000 reactions is very expensive and sometimes not feasible with the commonly used serial Nullspace Algorithm. In this work, we develop a distributed memory parallelization of the Nullspace Algorithm to handle efficiently the computation of the elementary modes of a large metabolic network. We give an implementation in C++ language with the support of MPI library functions for the parallel communication. Our proposed algorithm is accompanied with an analysis of the complexity and identification of major bottlenecks during computation of all possible pathways of a large metabolic network. The algorithm includes methods to achieve load balancing among the compute-nodes and specific communication patterns to reduce the communication overhead and improve efficiency.

Symbolic flux analysis for genome-scale metabolic networks

Background

With the advent of genomic technology, the size of metabolic networks that are subject to analysis is growing. A common task when analyzing metabolic networks is to find all possible steady state regimes. There are several technical issues that have to be addressed when analyzing large metabolic networks including accumulation of numerical errors and presentation of the solution to the researcher. One way to resolve those technical issues is to analyze the network using symbolic methods. The aim of this paper is to develop a routine that symbolically finds the steady state solutions of large metabolic networks.

Results

A symbolic Gauss-Jordan elimination routine was developed for analyzing large metabolic networks. This routine was tested by finding the steady state solutions for a number of curated stoichiometric matrices with the largest having about 4000 reactions. The routine was able to find the solution with a computational time similar to the time used by a numerical singular value decomposition routine. As an advantage of symbolic solution, a set of independent fluxes can be suggested by the researcher leading to the formation of a desired flux basis describing the steady state solution of the network. These independent fluxes can be constrained using experimental data. We demonstrate the application of constraints by calculating a flux distribution for the central metabolic and amino acid biosynthesis pathways of yeast.

Conclusions

We were able to find symbolic solutions for the steady state flux distribution of large metabolic networks. The ability to choose a flux basis was found to be useful in the constraint process and provides a strong argument for using symbolic Gauss-Jordan elimination in place of singular value decomposition.

On algebraic properties of extreme pathways in metabolic networks

We give a concise development of some of the major algebraic properties of extreme pathways (pathways that cannot be the result of combining other pathways) of metabolic networks, contrasting them to those of elementary flux modes (pathways involving a minimal set of reactions). In particular, we show that an extreme pathway can be recognized by a rank test as simple as the existing rank test for elementary flux modes, without computing all the modes. We make the observation that, unlike elementary flux modes, the property of being an extreme pathway depends on the presence or absence of reactions beyond those involved in the pathway itself. Hence, the property of being an extreme pathway is not a local property. As a consequence, we find that the set of all elementary flux modes for a network includes all the elementary flux modes for all its subnetworks, but that this property does not hold for the set of all extreme pathways.

Flux Design: In silico design of cell factories based on correlation of pathway fluxes to desired properties

Background

The identification of genetic target genes is a key step for rational engineering of production strains towards bio-based chemicals, fuels or therapeutics. This is often a difficult task, because superior production performance typically requires a combination of multiple targets, whereby the complex metabolic networks complicate straightforward identification. Recent attempts towards target prediction mainly focus on the prediction of gene deletion targets and therefore can cover only a part of genetic modifications proven valuable in metabolic engineering. Efficient in silico methods for simultaneous genome-scale identification of targets to be amplified or deleted are still lacking.

Results

Here we propose the identification of targets via flux correlation to a chosen objective flux as approach towards improved biotechnological production strains with optimally designed fluxes. The approach, we name Flux Design, computes elementary modes and, by search through the modes, identifies targets to be amplified (positive correlation) or down-regulated (negative correlation). Supported by statistical evaluation, a target potential is attributed to the identified reactions in a quantitative manner. Based on systems-wide models of the industrial microorganisms Corynebacterium glutamicum and Aspergillus niger, up to more than 20,000 modes were obtained for each case, differing strongly in production performance and intracellular fluxes. For lysine production in C. glutamicum the identified targets nicely matched with reported successful metabolic engineering strategies. In addition, simulations revealed insights, e.g. into the flexibility of energy metabolism. For enzyme production in A.niger flux correlation analysis suggested a number of targets, including non-obvious ones. Hereby, the relevance of most targets depended on the metabolic state of the cell and also on the carbon source.

Conclusions

Objective flux correlation analysis provided a detailed insight into the metabolic networks of industrially relevant prokaryotic and eukaryotic microorganisms. It was shown that capacity, pathway usage, and relevant genetic targets for optimal production partly depend on the network structure and the metabolic state of the cell which should be considered in future metabolic engineering strategies. The presented strategy can be generally used to identify priority sorted amplification and deletion targets for metabolic engineering purposes under various conditions and thus displays a useful strategy to be incorporated into efficient strain and bioprocess optimization.

Elementary mode analysis: a useful metabolic pathway analysis tool for characterizing cellular metabolism

Elementary mode analysis is a useful metabolic pathway analysis tool to identify the structure of a metabolic network that links the cellular phenotype to the corresponding genotype. The analysis can decompose the intricate metabolic network comprised of highly interconnected reactions into uniquely organized pathways. These pathways consisting of a minimal set of enzymes that can support steady state operation of cellular metabolism represent independent cellular physiological states. Such pathway definition provides a rigorous basis to systematically characterize cellular phenotypes, metabolic network regulation, robustness, and fragility that facilitate understanding of cell physiology and implementation of metabolic engineering strategies. This mini-review aims to overview the development and application of elementary mode analysis as a metabolic pathway analysis tool in studying cell physiology and as a basis of metabolic engineering.

Enabling technologies: fermentation and downstream processing

Efficient parallel tools for bioprocess design, consequent application of the concepts for metabolic process analysis as well as innovative downstream processing techniques are enabling technologies for new industrial bioprocesses from an engineering point of view. Basic principles, state-of-the-art techniques and cutting-edge technologies are briefly reviewed. Emphasis is on parallel bioreactors for bioprocess design, biochemical systems characterization and metabolic control analysis, as well as on preparative chromatography, affinity filtration and protein crystallization on a process scale.

Understanding the roadmap of metabolism by pathway analysis

The theoretical investigation of the structure of metabolic systems has recently attracted increasing interest. In this chapter, the basic concepts of metabolic pathway analysis are described and various applications are outlined. In particular, the concepts of nullspace and elementary flux modes are explained. The presentation is illustrated by a simple example from tyrosine metabolism and a system describing lysine production in Corynebacterium glutamicum. The latter system gives rise to 37 elementary modes, 36 of which produce lysine with different molar yields. The examples illustrate that metabolic pathway analysis is a useful tool for better understanding the complex architecture of intracellular metabolism, for determining the pathways on which the molar conversion yield of a substrate-product pair under study is maximal, and for assigning functions to orphan genes (functional genomics). Moreover, problems emerging in the modeling of large networks are discussed. An outlook on current trends in the field concludes the chapter.

Algorithmic approaches for computing elementary modes in large biochemical reaction networks

The concept of elementary (flux) modes provides a rigorous description of pathways in metabolic networks and proved to be valuable in a number of applications. However, the computation of elementary modes is a hard computational task that gave rise to several variants of algorithms during the last years. This work brings substantial progresses to this issue. The authors start with a brief review of results obtained from previous work regarding (a) a unified framework for elementary-mode computation, (b) network compression and redundancy removal and (c) the binary approach by which elementary modes are determined as binary patterns reducing the memory demand drastically without loss of speed. Then the authors will address herein further issues. First, a new way to perform the elementarity tests required during the computation of elementary modes which empirically improves significantly the computation time in large networks is proposed. Second, a method to compute only those elementary modes where certain reactions are involved is derived. Relying on this method, a promising approach for computing EMs in a completely distributed manner by decomposing the full problem in arbitrarity many sub-tasks is presented. The new methods have been implemented in the freely available software tools FluxAnalyzer and Metatool and benchmark tests in realistic networks emphasise the potential of our proposed algorithms.

Development of a metabolic network design and optimization framework incorporating implementation constraints: a succinate production case study

We have developed a pathway design and optimization scheme that accommodates genetically and/or environmentally derived operational constraints. We express the full set of theoretically optimal pathways in terms of the underlying elementary flux modes and then examine the sensitivity of the optimal yield to a wide class of physiological perturbations. Though the scheme is general it is best appreciated in a concrete context: we here take succinate production as our model system. The scheme produces novel pathway designs and leads to the construction of optimal succinate production pathway networks. The model predictions compare very favorably with experimental observations.

The geometry of the flux cone of a metabolic network

The analysis of metabolic networks has become a major topic in biotechnology in recent years. Applications range from the enhanced production of selected outputs to the prediction of genotype-phenotype relationships. The concepts used are based on the assumption of a pseudo steady-state of the network, so that for each metabolite inputs and outputs are balanced. The stoichiometric network analysis expands the steady state into a combination of nonredundant subnetworks with positive coefficients called extremal currents. Based on the unidirectional representation of the system these subnetworks form a convex cone in the flux-space. A modification of this approach allowing for reversible reactions led to the definition of elementary modes. Extreme pathways are obtained with the same method but splitting up internal reactions into forward and backward rates. In this study, we explore the relationship between these concepts. Due to the combinatorial explosion of the number of elementary modes in large networks, we promote a further set of metabolic routes, which we call the minimal generating set. It is the smallest subset of elementary modes required to describe all steady states of the system. For large-scale networks, the size of this set is of several magnitudes smaller than that of elementary modes and of extreme pathways.

YANA - a software tool for analyzing flux modes, gene-expression and enzyme activities

Background

A number of algorithms for steady state analysis of metabolic networks have been developed over the years. Of these, Elementary Mode Analysis (EMA) has proven especially useful. Despite its low user-friendliness, METATOOL as a reliable high-performance implementation of the algorithm has been the instrument of choice up to now. As reported here, the analysis of metabolic networks has been improved by an editor and analyzer of metabolic flux modes. Analysis routines for expression levels and the most central, well connected metabolites and their metabolic connections are of particular interest.

Results

YANA features a platform-independent, dedicated toolbox for metabolic networks with a graphical user interface to calculate (integrating METATOOL), edit (including support for the SBML format), visualize, centralize, and compare elementary flux modes. Further, YANA calculates expected flux distributions for a given Elementary Mode (EM) activity pattern and vice versa. Moreover, a dissection algorithm, a centralization algorithm, and an average diameter routine can be used to simplify and analyze complex networks. Proteomics or gene expression data give a rough indication of some individual enzyme activities, whereas the complete flux distribution in the network is often not known. As such data are noisy, YANA features a fast evolutionary algorithm (EA) for the prediction of EM activities with minimum error, including alerts for inconsistent experimental data. We offer the possibility to include further known constraints (e.g. growth constraints) in the EA calculation process. The redox metabolism around glutathione reductase serves as an illustration example. All software and documentation are available for download at .

Conclusion

A graphical toolbox and an editor for METATOOL as well as a series of additional routines for metabolic network analyses constitute a new user-friendly software for such efforts.

An improved algorithm for stoichiometric network analysis: theory and applications

MOTIVATION

Genome scale analysis of the metabolic network of a microorganism is a major challenge in bioinformatics. The combinatorial explosion, which occurs during the construction of elementary fluxes (non-redundant pathways) requires sophisticated and efficient algorithms to tackle the problem.

RESULTS

Mathematically, the calculation of elementary fluxes amounts to characterizing the space of solutions to a mixed system of linear equalities, given by the stoichiometry matrix, and linear inequalities, arising from the irreversibility of some or all of the reactions in the network. Previous approaches to this problem have iteratively solved for the equalities while satisfying the inequalities throughout the process. In an extension of previous work, here we consider the complementary approach and derive an algorithm which satisfies the inequalities one by one while staying in the space of solution of the equality constraints. Benchmarks on different subnetworks of the central carbon metabolism of Escherichia coli show that this new approach yields a significant reduction in the execution time of the calculation. This reduction arises since the odds that an intermediate elementary flux already fulfills an additional inequality are larger than when having to satisfy an additional equality constraint.

Chromokinetics of metabolic pathways

Some methods to study and intuitively understand steady-state flows in complicated metabolic pathways are discussed. For this purpose, a suitable decomposition of complex metabolic schemes into smaller subsystems is used. These independent subsystems are then interpreted as basic colors of a chromatic coloring scheme. The mixture of these basic colors allows an intuitive picture of how a steady state in a metabolic pathway can be understood. Furthermore, actions of drugs can be more easily investigated on this basis. An anaerobic variant of pyruvate metabolism in rat liver mitochondria is presented as a simple example. This experiment allows measurement of the percentage that each basic color contributes to the steady states resulting from different experimental conditions. Possible implementations of existing algorithms and rational design of new drugs are discussed. A MATHEMATICA program, based on a new algorithm for finding all basic colors of stoichiometric networks, is included.