An algebraic-combinatorial model for the identification and mapping of biochemical pathways

Fast-SNP: a fast matrix pre-processing algorithm for efficient loopless flux optimization of metabolic models

Motivation: Computation of steady-state flux solutions in large metabolic models is routinely performed using flux balance analysis based on a simple LP (Linear Programming) formulation. A minimal requirement for thermodynamic feasibility of the flux solution is the absence of internal loops, which are enforced using ‘loopless constraints’. The resulting loopless flux problem is a substantially harder MILP (Mixed Integer Linear Programming) problem, which is computationally expensive for large metabolic models.

Results: We developed a pre-processing algorithm that significantly reduces the size of the original loopless problem into an easier and equivalent MILP problem. The pre-processing step employs a fast matrix sparsification algorithm—Fast- sparse null-space pursuit (SNP)—inspired by recent results on SNP. By finding a reduced feasible ‘loop-law’ matrix subject to known directionalities, Fast-SNP considerably improves the computational efficiency in several metabolic models running different loopless optimization problems. Furthermore, analysis of the topology encoded in the reduced loop matrix enabled identification of key directional constraints for the potential permanent elimination of infeasible loops in the underlying model. Overall, Fast-SNP is an effective and simple algorithm for efficient formulation of loop-law constraints, making loopless flux optimization feasible and numerically tractable at large scale.

Availability and Implementation: Source code for MATLAB including examples is freely available for download at http://www.aibn.uq.edu.au/cssb-resources under Software. Optimization uses Gurobi, CPLEX or GLPK (the latter is included with the algorithm).

Contact:lars.nielsen@uq.edu.au

Supplementary information:Supplementary data are available at Bioinformatics online.

Enzyme allocation problems in kinetic metabolic networks: optimal solutions are elementary flux modes

The survival and proliferation of cells and organisms require a highly coordinated allocation of cellular resources to ensure the efficient synthesis of cellular components. In particular, the total enzymatic capacity for cellular metabolism is limited by finite resources that are shared between all enzymes, such as cytosolic space, energy expenditure for amino-acid synthesis, or micro-nutrients. While extensive work has been done to study constrained optimization problems based only on stoichiometric information, mathematical results that characterize the optimal flux in kinetic metabolic networks are still scarce. Here, we study constrained enzyme allocation problems with general kinetics, using the theory of oriented matroids. We give a rigorous proof for the fact that optimal solutions of the non-linear optimization problem are elementary flux modes. This finding has significant consequences for our understanding of optimality in metabolic networks as well as for the identification of metabolic switches and the computation of optimal flux distributions in kinetic metabolic networks.

Hemojuvelin-hepcidin axis modeled and analyzed using Petri nets

Systems biology approach to investigate biological phenomena seems to be very promising because it is capable to capture one of the fundamental properties of living organisms, i.e. their inherent complexity. It allows for analysis biological entities as complex systems of interacting objects. The first and necessary step of such an analysis is building a precise model of the studied biological system. This model is expressed in the language of some branch of mathematics, as for example, differential equations. During the last two decades the theory of Petri nets has appeared to be very well suited for building models of biological systems. The structure of these nets reflects the structure of interacting biological molecules and processes. Moreover, on one hand, Petri nets have intuitive graphical representation being very helpful in understanding the structure of the system and on the other hand, there is a lot of mathematical methods and software tools supporting an analysis of the properties of the nets. In this paper a Petri net based model of the hemojuvelin-hepcidin axis involved in the maintenance of the human body iron homeostasis is presented. The analysis based mainly on T-invariants of the model properties has been made and some biological conclusions have been drawn.

Fast thermodynamically constrained flux variability analysis

MOTIVATION

Flux variability analysis (FVA) is an important tool to further analyse the results obtained by flux balance analysis (FBA) on genome-scale metabolic networks. For many constraint-based models, FVA identifies unboundedness of the optimal flux space. This reveals that optimal flux solutions with net flux through internal biochemical loops are feasible, which violates the second law of thermodynamics. Such unbounded fluxes may be eliminated by extending FVA with thermodynamic constraints.

RESULTS

We present a new algorithm for efficient flux variability (and flux balance) analysis with thermodynamic constraints, suitable for analysing genome-scale metabolic networks. We first show that FBA with thermodynamic constraints is NP-hard. Then we derive a theoretical tractability result, which can be applied to metabolic networks in practice. We use this result to develop a new constraint programming algorithm Fast-tFVA for fast FVA with thermodynamic constraints (tFVA). Computational comparisons with previous methods demonstrate the efficiency of the new method. For tFVA, a speed-up of factor 30-300 is achieved. In an analysis of genome-scale metabolic networks in the BioModels database, we found that in 485 of 716 networks, additional irreversible or fixed reactions could be detected.

AVAILABILITY AND IMPLEMENTATION

Fast-tFVA is written in C++ and published under GPL. It uses the open source software SCIP and libSBML. There also exists a Matlab interface for easy integration into Matlab. Fast-tFVA is available from page.mi.fu-berlin.de/arnem/fast-tfva.html.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

MODELING AND SIMULATION OF MOLECULAR BIOLOGY SYSTEMS USING PETRI NETS: MODELING GOALS OF VARIOUS APPROACHES

Petri nets are a discrete event simulation approach developed for system representation, in particular for their concurrency and synchronization properties. Various extensions to the original theory of Petri nets have been used for modeling molecular biology systems and metabolic networks. These extensions are stochastic, colored, hybrid and functional. This paper carries out an initial review of the various modeling approaches based on Petri net found in the literature, and of the biological systems that have been successfully modeled with these approaches. Moreover, the modeling goals and possibilities of qualitative analysis and system simulation of each approach are discussed.

A topological approach to chemical organizations

Large chemical reaction networks often exhibit distinctive features that can be interpreted as higher-level structures. Prime examples are metabolic pathways in a biochemical context. We review mathematical approaches that exploit the stoichiometric structure, which can be seen as a particular directed hypergraph, to derive an algebraic picture of chemical organizations. We then give an alternative interpretation in terms of set-valued set functions that encapsulate the production rules of the individual reactions. From the mathematical point of view, these functions define generalized topological spaces on the set of chemical species. We show that organization-theoretic concepts also appear in a natural way in the topological language. This abstract representation in turn suggests the exploration of the chemical meaning of well-established topological concepts. As an example, we consider connectedness in some detail.

Complementary identification of multiple flux distributions and multiple metabolic pathways

Cell robustness and complexity have been recognized as unique features of biological systems. Such robustness and complexity of metabolic-reaction systems can be explored by discovering, or identifying, the multiple flux distributions (MFD) and redundant pathways that lead to a given external state; however, this is exceedingly cumbersome to accomplish. It is, therefore, highly desirable to establish an effective computational method for their identification, which, in turn, gives rise to a novel insight into the cellular function. An effective approach is proposed for complementarily identifying MFD in metabolic flux analysis and multiple metabolic pathways (MMP) in structural pathway analysis. This approach judiciously integrates flux balance analysis (FBA) based on linear programming and the graph-theoretic method for determining reaction pathways. A single metabolic pathway, with the concomitant flux distribution and the overall reaction manifesting itself as the desired phenotype under some environmental conditions, is determined by FBA from the initial candidate sequence of metabolic reactions. Subsequently, the graph-theoretic method recovers all feasible MMP and the corresponding MFD. The approach's efficacy is demonstrated by applying it to the in silico Escherichia coli model under various culture conditions. The resultant MMP and MFD attaining a unique external state reveal the surprising adaptability and robustness of the intricate cellular network as a key to cell survival against environmental or genetic changes. These results indicate that the proposed approach would be useful in facilitating drug discovery.

Hyperdigraph-theoretic analysis of the EGFR signaling network: initial steps leading to GTP:Ras complex formation

We construct an algebraic-combinatorial model of the SOS compartment of the EGFR biochemical network. A Petri net is used to construct an initial representation of the biochemical decision making network, which in turn defines a hyperdigraph. We observe that the linear algebraic structure of each hyperdigraph admits a canonical set of algebraic-combinatorial invariants that correspond to the information flow conservation laws governing a molecular kinetic reaction network. The linear algebraic structure of the hyperdigraph and its sets of invariants can be generalized to define a discrete algebraic-geometric structure, which is referred to as an oriented matroid. Oriented matroids define a polyhedral optimization geometry that is used to determine optimal subpaths that span the nullspace of a set of kinetic chemical reaction equations. Sets of constrained submodular path optimizations on the hyperdigraph are objectively obtained as a spanning tree of minimum cycle paths. This complete set of subcircuits is used to identify the network pinch points and invariant flow subpaths. We demonstrate that this family of minimal circuits also characteristically identifies additional significant biochemical reaction pattern features. We use the SOS Compartment A of the EGFR biochemical pathway to develop and demonstrate the application of our algebraic-combinatorial mathematical modeling methodology.

Thermodynamic constraints for biochemical networks

The constraint-based approach to analysis of biochemical systems has emerged as a useful tool for rational metabolic engineering. Flux balance analysis (FBA) is based on the constraint of mass conservation; energy balance analysis (EBA) is based on non-equilibrium thermodynamics. The power of these approaches lies in the fact that the constraints are based on physical laws, and do not make use of unknown parameters. Here, we show that the network structure (i.e. the stoichiometric matrix) alone provides a system of constraints on the fluxes in a biochemical network which are feasible according to both mass balance and the laws of thermodynamics. A realistic example shows that these constraints can be sufficient for deriving unambiguous, biologically meaningful results. The thermodynamic constraints are obtained by comparing of the sign pattern of the flux vector to the sign patterns of the cycles of the internal cycle space via connection between stoichiometric network theory (SNT) and the mathematical theory of oriented matroids.

A computational model for the identification of biochemical pathways in the krebs cycle

We have applied an algorithmic methodology which provably decomposes any complex network into a complete family of principal subcircuits to study the minimal circuits that describe the Krebs cycle. Every operational behavior that the network is capable of exhibiting can be represented by some combination of these principal subcircuits and this computational decomposition is linearly efficient. We have developed a computational model that can be applied to biochemical reaction systems which accurately renders pathways of such reactions via directed hypergraphs (Petri nets). We have applied the model to the citric acid cycle (Krebs cycle). The Krebs cycle, which oxidizes the acetyl group of acetyl CoA to CO(2) and reduces NAD and FAD to NADH and FADH(2), is a complex interacting set of nine subreaction networks. The Krebs cycle was selected because of its familiarity to the biological community and because it exhibits enough complexity to be interesting in order to introduce this novel analytic approach. This study validates the algorithmic methodology for the identification of significant biochemical signaling subcircuits, based solely upon the mathematical model and not upon prior biological knowledge. The utility of the algebraic-combinatorial model for identifying the complete set of biochemical subcircuits as a data set is demonstrated for this important metabolic process.

Metabolic pathways in the post-genome era

Metabolic pathways are a central paradigm in biology. Historically, they have been defined on the basis of their step-by-step discovery. However, the genome-scale metabolic networks now being reconstructed from annotation of genome sequences demand new network-based definitions of pathways to facilitate analysis of their capabilities and functions, such as metabolic versatility and robustness, and optimal growth rates. This demand has led to the development of a new mathematically based analysis of complex, metabolic networks that enumerates all their unique pathways that take into account all requirements for cofactors and byproducts. Applications include the design of engineered biological systems, the generation of testable hypotheses regarding network structure and function, and the elucidation of properties that can not be described by simple descriptions of individual components (such as product yield, network robustness, correlated reactions and predictions of minimal media). Recently, these properties have also been studied in genome-scale networks. Thus, network-based pathways are emerging as an important paradigm for analysis of biological systems.

Stoichiometric network theory for nonequilibrium biochemical systems

We introduce the basic concepts and develop a theory for nonequilibrium steady-state biochemical systems applicable to analyzing large-scale complex isothermal reaction networks. In terms of the stoichiometric matrix, we demonstrate both Kirchhoff's flux law sigma(l)J(l)=0 over a biochemical species, and potential law sigma(l) mu(l)=0 over a reaction loop. They reflect mass and energy conservation, respectively. For each reaction, its steady-state flux J can be decomposed into forward and backward one-way fluxes J = J+ - J-, with chemical potential difference deltamu = RT ln(J-/J+). The product -Jdeltamu gives the isothermal heat dissipation rate, which is necessarily non-negative according to the second law of thermodynamics. The stoichiometric network theory (SNT) embodies all of the relevant fundamental physics. Knowing J and deltamu of a biochemical reaction, a conductance can be computed which directly reflects the level of gene expression for the particular enzyme. For sufficiently small flux a linear relationship between J and deltamu can be established as the linear flux-force relation in irreversible thermodynamics, analogous to Ohm's law in electrical circuits.

Modeling and simulation of pathways in menopause

The analytical representation and simulation of complex molecular pathways can contribute to understanding and evaluating physiological as well as pathological processes. We are interested in modeling the processes of menopause to stratify women in terms of the genotypic and environmental components and their implications for development of individualized risk of postmenopausal disorders, e.g., breast and ovarian cancer, cardiovascular disease, and osteoporosis. We have initiated this study using the UltraSAN package to analyze the pathway associated with estrogen production. This model incorporates detailed information about the hormone factors affecting estrogen production, and the simulations carried out are based on published experimental data corresponding to hormone levels during the course of the normal female reproductive cycle. The agreement between the experimental data and the simulation is typically less than 2 ng/ml or 2 pg/ml respectively for progesterone and estradiol output. This approach further permits inclusion of information about an SNP observed in the gene coding for the enzyme aromatase as a model to study the impact of reduced enzymatic activity on hormone levels.