The solution space of metabolic networks: Producibility, robustness and fluctuations

Constraint satisfaction mechanisms for marginal stability and criticality in large ecosystems

We discuss a resource-competition model, which takes MacArthur's model as a platform, to unveil interesting connections with glassy features and jamming in high dimensions. This model, as first studied by Tikhonov and Monasson, presents two qualitatively different phases: a shielded phase, where a collective, self-sustained behavior emerges, and a vulnerable phase, where a small perturbation can destabilize the system and contribute to population extinction. We first present our perspective based on a strong similarity with continuous constraint satisfaction problems in their convex regime. Then, we discuss the stability analysis in terms of the computation of the leading eigenvalue of the Hessian matrix of the associated Lyapunov function. This computation allows us to efficiently distinguish between the two aforementioned phases and to relate high-dimensional critical ecosystems to glassy phenomena in the low-temperature regime.

Collective Phase in Resource Competition in a Highly Diverse Ecosystem

Organisms shape their own environment, which in turn affects their survival. This feedback becomes especially important for communities containing a large number of species; however, few existing approaches allow studying this regime, except in simulations. Here, we use methods of statistical physics to analytically solve a classic ecological model of resource competition introduced by MacArthur in 1969. We show that the nonintuitive phenomenology of highly diverse ecosystems includes a phase where the environment constructed by the community becomes fully decoupled from the outside world.

Counting and correcting thermodynamically infeasible flux cycles in genome-scale metabolic networks

Thermodynamics constrains the flow of matter in a reaction network to occur through routes along which the Gibbs energy decreases, implying that viable steady-state flux patterns should be void of closed reaction cycles. Identifying and removing cycles in large reaction networks can unfortunately be a highly challenging task from a computational viewpoint. We propose here a method that accomplishes it by combining a relaxation algorithm and a Monte Carlo procedure to detect loops, with ad hoc rules (discussed in detail) to eliminate them. As test cases, we tackle (a) the problem of identifying infeasible cycles in the E. coli metabolic network and (b) the problem of correcting thermodynamic infeasibilities in the Flux-Balance-Analysis solutions for 15 human cell-type-specific metabolic networks. Results for (a) are compared with previous analyses of the same issue, while results for (b) are weighed against alternative methods to retrieve thermodynamically viable flux patterns based on minimizing specific global quantities. Our method, on the one hand, outperforms previous techniques and, on the other, corrects loopy solutions to Flux Balance Analysis. As a byproduct, it also turns out to be able to reveal possible inconsistencies in model reconstructions.

Thermodynamics of biochemical networks and duality theorems

One interesting yet difficult computational issue has recently been posed in biophysics in regard to the implementation of thermodynamic constraints to complex networks. Biochemical networks of enzymes inside cells are among the most efficient, robust, differentiated, and flexible free-energy transducers in nature. How is the second law of thermodynamics encoded for these complex networks? In this article it is demonstrated that for chemical reaction networks in the steady state the exclusion (presence) of closed reaction cycles makes possible (impossible) the definition of a chemical potential vector. Interestingly, this statement is encoded in one of the key results in combinatorial optimization, i.e., the Gordan theorem of the alternatives. From a computational viewpoint, the theorem reveals that calculating a reaction's free energy and identifying infeasible loops in flux states are dual problems whose solutions are mutually exclusive, and this opens the way for efficient and scalable methods to perform the energy balance analysis of large-scale biochemical networks.

A scalable algorithm to explore the Gibbs energy landscape of genome-scale metabolic networks

The integration of various types of genomic data into predictive models of biological networks is one of the main challenges currently faced by computational biology. Constraint-based models in particular play a key role in the attempt to obtain a quantitative understanding of cellular metabolism at genome scale. In essence, their goal is to frame the metabolic capabilities of an organism based on minimal assumptions that describe the steady states of the underlying reaction network via suitable stoichiometric constraints, specifically mass balance and energy balance (i.e. thermodynamic feasibility). The implementation of these requirements to generate viable configurations of reaction fluxes and/or to test given flux profiles for thermodynamic feasibility can however prove to be computationally intensive. We propose here a fast and scalable stoichiometry-based method to explore the Gibbs energy landscape of a biochemical network at steady state. The method is applied to the problem of reconstructing the Gibbs energy landscape underlying metabolic activity in the human red blood cell, and to that of identifying and removing thermodynamically infeasible reaction cycles in the Escherichia coli metabolic network (iAF1260). In the former case, we produce consistent predictions for chemical potentials (or log-concentrations) of intracellular metabolites; in the latter, we identify a restricted set of loops (23 in total) in the periplasmic and cytoplasmic core as the origin of thermodynamic infeasibility in a large sample (10(6)) of flux configurations generated randomly and compatibly with the prior information available on reaction reversibility.