MERRIN: MEtabolic regulation rule INference from time series data.

MOTIVATION: Many techniques have been developed to infer Boolean regulations from a prior knowledge network (PKN) and experimental data. Existing methods are able to reverse-engineer Boolean regulations for transcriptional and signaling networks, but they fail to infer regulations that control metabolic networks. RESULTS: We present a novel approach to infer Boolean rules for metabolic regulation from time-series data and a PKN. Our method is based on a combination of answer set programming and linear programming. By solving both combinatorial and linear arithmetic constraints, we generate candidate Boolean regulations that can reproduce the given data when coupled to the metabolic network. We evaluate our approach on a core regulated metabolic network and show how the quality of the predictions depends on the available kinetic, fluxomics or transcriptomics time-series data. AVAILABILITY AND IMPLEMENTATION: Software available at https://github.com/bioasp/merrin. SUPPLEMENTARY INFORMATION: Supplementary data are available at https://doi.org/10.5281/zenodo.6670164.

On the geometry of elementary flux modes.

Elementary flux modes (EFMs) play a prominent role in the constraint-based analysis of metabolic networks. They correspond to minimal functional units of the metabolic network at steady-state and as such have been studied for almost 30 years. The set of all EFMs in a metabolic network tends to be very large and may have exponential size in the number of reactions. Hence, there is a need to elucidate the structure of this set. Here we focus on geometric properties of EFMs. We analyze the distribution of EFMs in the face lattice of the steady-state flux cone of the metabolic network and show that EFMs in the relative interior of the cone occur only in very special cases. We introduce the concept of degree of an EFM as a measure how elementary it is and study the decomposition of flux vectors and EFMs depending on their degree. Geometric analysis can help to better understand the structure of the set of EFMs, which is important from both the mathematical and the biological viewpoint.

Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection.

MOTIVATION: Minimal cut sets (MCSs) for metabolic networks are sets of reactions which, if they are removed from the network, prevent a target reaction from carrying flux. To compute MCSs different methods exist, which may fail to find sufficiently many MCSs for larger genome-scale networks. RESULTS: Here we introduce irreversible minimal cut sets (iMCSs). These are MCSs that consist of irreversible reactions only. The advantage of iMCSs is that they can be computed by projecting the flux cone of the metabolic network on the set of irreversible reactions, which usually leads to a smaller cone. Using oriented matroid theory, we show how the projected cone can be computed efficiently and how this can be applied to find iMCSs even in large genome-scale networks. AVAILABILITY AND IMPLEMENTATION: Software is freely available at https://sourceforge.net/projects/irreversibleminimalcutsets/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Regulatory dynamic enzyme-cost flux balance analysis: A unifying framework for constraint-based modeling.

Integrated modeling of metabolism and gene regulation continues to be a major challenge in computational biology. While there exist approaches like regulatory flux balance analysis (rFBA), dynamic flux balance analysis (dFBA), resource balance analysis (RBA) or dynamic enzyme-cost flux balance analysis (deFBA) extending classical flux balance analysis (FBA) in various directions, there have been no constraint-based methods so far that allow predicting the dynamics of metabolism taking into account both macromolecule production costs and regulatory events. In this paper, we introduce a new constraint-based modeling framework named regulatory dynamic enzyme-cost flux balance analysis (r-deFBA), which unifies dynamic modeling of metabolism, cellular resource allocation and transcriptional regulation in a hybrid discrete-continuous setting. With r-deFBA, we can predict discrete regulatory states together with the continuous dynamics of reaction fluxes, external substrates, enzymes, and regulatory proteins needed to achieve a cellular objective such as maximizing biomass over a time interval. The dynamic optimization problem underlying r-deFBA can be reformulated as a mixed-integer linear optimization problem, for which there exist efficient solvers.

Cellular trade-offs and optimal resource allocation during cyanobacterial diurnal growth.

Cyanobacteria are an integral part of Earth's biogeochemical cycles and a promising resource for the synthesis of renewable bioproducts from atmospheric CO2 Growth and metabolism of cyanobacteria are inherently tied to the diurnal rhythm of light availability. As yet, however, insight into the stoichiometric and energetic constraints of cyanobacterial diurnal growth is limited. Here, we develop a computational framework to investigate the optimal allocation of cellular resources during diurnal phototrophic growth using a genome-scale metabolic reconstruction of the cyanobacterium Synechococcus elongatus PCC 7942. We formulate phototrophic growth as an autocatalytic process and solve the resulting time-dependent resource allocation problem using constraint-based analysis. Based on a narrow and well-defined set of parameters, our approach results in an ab initio prediction of growth properties over a full diurnal cycle. The computational model allows us to study the optimality of metabolite partitioning during diurnal growth. The cyclic pattern of glycogen accumulation, an emergent property of the model, has timing characteristics that are in qualitative agreement with experimental findings. The approach presented here provides insight into the time-dependent resource allocation problem of phototrophic diurnal growth and may serve as a general framework to assess the optimality of metabolic strategies that evolved in phototrophic organisms under diurnal conditions.

Formalizing Metabolic-Regulatory Networks by Hybrid Automata.

Computational approaches in systems biology have become a powerful tool for understanding the fundamental mechanisms of cellular metabolism and regulation. However, the interplay between the regulatory and the metabolic system is still poorly understood. In particular, there is a need for formal mathematical frameworks that allow analyzing metabolism together with dynamic enzyme resources and regulatory events. Here, we introduce a metabolic-regulatory network model (MRN) that allows integrating metabolism with transcriptional regulation, macromolecule production and enzyme resources. Using this model, we show that the dynamic interplay between these different cellular processes can be formalized by a hybrid automaton, combining continuous dynamics and discrete control.

Finding MEMo: minimum sets of elementary flux modes.

Metabolic network reconstructions are widely used in computational systems biology for in silico studies of cellular metabolism. A common approach to analyse these models are elementary flux modes (EFMs), which correspond to minimal functional units in the network. Already for medium-sized networks, it is often impossible to compute the set of all EFMs, due to their huge number. From a practical point of view, this might also not be necessary because a subset of EFMs may already be sufficient to answer relevant biological questions. In this article, we study MEMos or minimum sets of EFMs that can generate all possible steady-state behaviours of a metabolic network. The number of EFMs in a MEMo may be by several orders of magnitude smaller than the total number of EFMs. Using MEMos, we can compute generating sets of EFMs in metabolic networks where the whole set of EFMs is too large to be enumerated.

A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.

BACKGROUND: Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. RESULTS: Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. CONCLUSIONS: Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.

Dynamic optimization of metabolic networks coupled with gene expression.

The regulation of metabolic activity by tuning enzyme expression levels is crucial to sustain cellular growth in changing environments. Metabolic networks are often studied at steady state using constraint-based models and optimization techniques. However, metabolic adaptations driven by changes in gene expression cannot be analyzed by steady state models, as these do not account for temporal changes in biomass composition. Here we present a dynamic optimization framework that integrates the metabolic network with the dynamics of biomass production and composition. An approximation by a timescale separation leads to a coupled model of quasi-steady state constraints on the metabolic reactions, and differential equations for the substrate concentrations and biomass composition. We propose a dynamic optimization approach to determine reaction fluxes for this model, explicitly taking into account enzyme production costs and enzymatic capacity. In contrast to the established dynamic flux balance analysis, our approach allows predicting dynamic changes in both the metabolic fluxes and the biomass composition during metabolic adaptations. Discretization of the optimization problems leads to a linear program that can be efficiently solved. We applied our algorithm in two case studies: a minimal nutrient uptake network, and an abstraction of core metabolic processes in bacteria. In the minimal model, we show that the optimized uptake rates reproduce the empirical Monod growth for bacterial cultures. For the network of core metabolic processes, the dynamic optimization algorithm predicted commonly observed metabolic adaptations, such as a diauxic switch with a preference ranking for different nutrients, re-utilization of waste products after depletion of the original substrate, and metabolic adaptation to an impending nutrient depletion. These examples illustrate how dynamic adaptations of enzyme expression can be predicted solely from an optimization principle.

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.

Flux modules in metabolic networks.

The huge number of elementary flux modes in genome-scale metabolic networks makes analysis based on elementary flux modes intrinsically difficult. However, it has been shown that the elementary flux modes with optimal yield often contain highly redundant information. The set of optimal-yield elementary flux modes can be compressed using modules. Up to now, this compression was only possible by first enumerating the whole set of all optimal-yield elementary flux modes. We present a direct method for computing modules of the thermodynamically constrained optimal flux space of a metabolic network. This method can be used to decompose the set of optimal-yield elementary flux modes in a modular way and to speed up their computation. In addition, it provides a new form of coupling information that is not obtained by classical flux coupling analysis. We illustrate our approach on a set of model organisms.

Analysis and characterization of asynchronous state transition graphs using extremal states.

Logical modeling of biological regulatory networks gives rise to a representation of the system's dynamics as a so-called state transition graph. Analysis of such a graph in its entirety allows for a comprehensive understanding of the functionalities and behavior of the modeled system. However, the size of the vertex set of the graph is exponential in the number of the network components making analysis costly, motivating development of reduction methods. In this paper, we present results allowing for a complete description of an asynchronous state transition graph of a Thomas network solely based on the analysis of the subgraph induced by certain extremal states. Utilizing this notion, we compare the behavior of a simple multivalued network and a corresponding Boolean network and analyze the conservation of dynamical properties between them. Understanding the relation between such coarser and finer models is a necessary step toward meaningful network reduction as well as model refinement methods.

F2C2: a fast tool for the computation of flux coupling in genome-scale metabolic networks.

BACKGROUND: Flux coupling analysis (FCA) has become a useful tool in the constraint-based analysis of genome-scale metabolic networks. FCA allows detecting dependencies between reaction fluxes of metabolic networks at steady-state. On the one hand, this can help in the curation of reconstructed metabolic networks by verifying whether the coupling between reactions is in agreement with the experimental findings. On the other hand, FCA can aid in defining intervention strategies to knock out target reactions. RESULTS: We present a new method F2C2 for FCA, which is orders of magnitude faster than previous approaches. As a consequence, FCA of genome-scale metabolic networks can now be performed in a routine manner. CONCLUSIONS: We propose F2C2 as a fast tool for the computation of flux coupling in genome-scale metabolic networks. F2C2 is freely available for non-commercial use at https://sourceforge.net/projects/f2c2/files/.

Network reduction in metabolic pathway analysis: elucidation of the key pathways involved in the photoautotrophic growth of the green alga Chlamydomonas reinhardtii.

Metabolic pathway analysis aims at discovering and analyzing meaningful routes and their interactions in metabolic networks. A major difficulty in applying this technique lies in the decomposition of metabolic flux distributions into elementary mode or extreme pathway activity patterns, which in general is not unique. We propose a network reduction approach based on the decomposition of a set of flux vectors representing adaptive microbial metabolic behavior in bioreactors into a minimal set of shared pathways. Several optimality criteria from the literature were compared in order to select the most appropriate objective function. We further analyze photoautotrophic metabolism of the green alga Chlamydomonas reinhardtii growing in a photobioreactor under maximal growth rate conditions. Key pathways involved in its adaptive metabolic response to changes in light influx are identified and discussed using an energetic approach.

On flux coupling analysis of metabolic subsystems.

Genome-scale metabolic networks are useful tools for achieving a system-level understanding of metabolism. However, due to their large size, analysis of such networks may be difficult and algorithms can be very slow. Therefore, some authors have suggested to analyze subsystems instead of the original genome-scale models. Flux coupling analysis (FCA) is a well-known method for detecting functionally related reactions in metabolic networks. In this paper, we study how flux coupling relations may change if we analyze a subsystem instead of the original network. We show mathematically that a pair of fully, partially or directionally coupled reactions may be detected as uncoupled in certain subsystems. Interestingly, this behavior is the opposite of the flux coupling changes that may occur due to missing reactions, or equivalently, deletion of reactions. Computational experiments suggest that the analysis of plastid (but not mitochondrial) subsystems may significantly influence the results of FCA. Therefore, the results of FCA for subsystems, especially plastid subsystems, should be interpreted with care.

Time-Optimal Adaptation in Metabolic Network Models.

Analysis of metabolic models using constraint-based optimization has emerged as an important computational technique to elucidate and eventually predict cellular metabolism and growth. In this work, we introduce time-optimal adaptation (TOA), a new constraint-based modeling approach that allows us to evaluate the fastest possible adaptation to a pre-defined cellular state while fulfilling a given set of dynamic and static constraints. TOA falls into the mathematical problem class of time-optimal control problems, and, in its general form, can be broadly applied and thereby extends most existing constraint-based modeling frameworks. Specifically, we introduce a general mathematical framework that captures many existing constraint-based methods and define TOA within this framework. We then exemplify TOA using a coarse-grained self-replicator model and demonstrate that TOA allows us to explain several well-known experimental phenomena that are difficult to explore using existing constraint-based analysis methods. We show that TOA predicts accumulation of storage compounds in constant environments, as well as overshoot uptake metabolism after periods of nutrient scarcity. TOA shows that organisms with internal temporal degrees of freedom, such as storage, can in most environments outperform organisms with a static intracellular composition. Furthermore, TOA reveals that organisms adapted to better growth conditions than present in the environment ("optimists") typically outperform organisms adapted to poorer growth conditions ("pessimists").

FFCA: a feasibility-based method for flux coupling analysis of metabolic networks.

BACKGROUND: Flux coupling analysis (FCA) is a useful method for finding dependencies between fluxes of a metabolic network at steady-state. FCA classifies reactions into subsets (called coupled reaction sets) in which activity of one reaction implies activity of another reaction. Several approaches for FCA have been proposed in the literature. RESULTS: We introduce a new FCA algorithm, FFCA (Feasibility-based Flux Coupling Analysis), which is based on checking the feasibility of a system of linear inequalities. We show on a set of benchmarks that for genome-scale networks FFCA is faster than other existing FCA methods. CONCLUSIONS: We present FFCA as a new method for flux coupling analysis and prove it to be faster than existing approaches. A corresponding software tool is freely available for non-commercial use at http://www.bioinformatics.org/ffca/.

Elucidating temporal resource allocation and diurnal dynamics in phototrophic metabolism using conditional FBA.

The computational analysis of phototrophic growth using constraint-based optimization requires to go beyond current time-invariant implementations of flux-balance analysis (FBA). Phototrophic organisms, such as cyanobacteria, rely on harvesting the sun's energy for the conversion of atmospheric CO2 into organic carbon, hence their metabolism follows a strongly diurnal lifestyle. We describe the growth of cyanobacteria in a periodic environment using a new method called conditional FBA. Our approach enables us to incorporate the temporal organization and conditional dependencies into a constraint-based description of phototrophic metabolism. Specifically, we take into account that cellular processes require resources that are themselves products of metabolism. Phototrophic growth can therefore be formulated as a time-dependent linear optimization problem, such that optimal growth requires a differential allocation of resources during different times of the day. Conditional FBA then allows us to simulate phototrophic growth of an average cell in an environment with varying light intensity, resulting in dynamic time-courses for all involved reaction fluxes, as well as changes in biomass composition over a diurnal cycle. Our results are in good agreement with several known facts about the temporal organization of phototrophic growth and have implications for further analysis of resource allocation problems in phototrophic metabolism.

Double and multiple knockout simulations for genome-scale metabolic network reconstructions.

BACKGROUND: Constraint-based modeling of genome-scale metabolic network reconstructions has become a widely used approach in computational biology. Flux coupling analysis is a constraint-based method that analyses the impact of single reaction knockouts on other reactions in the network. RESULTS: We present an extension of flux coupling analysis for double and multiple gene or reaction knockouts, and develop corresponding algorithms for an in silico simulation. To evaluate our method, we perform a full single and double knockout analysis on a selection of genome-scale metabolic network reconstructions and compare the results. SOFTWARE: A prototype implementation of double knockout simulation is available at http://hoverboard.io/L4FC.

Generic flux coupling analysis.

Flux coupling analysis (FCA) has become a useful tool for aiding metabolic reconstructions and guiding genetic manipulations. Originally, it was introduced for constraint-based models of metabolic networks that are based on the steady-state assumption. Recently, we have shown that the steady-state assumption can be replaced by a weaker lattice-theoretic property related to the supports of metabolic fluxes. In this paper, we further extend our approach and develop an efficient algorithm for generic flux coupling analysis that works with any kind of qualitative pathway model. We illustrate our method by thermodynamic flux coupling analysis (tFCA), which allows studying steady-state metabolic models with loop-law thermodynamic constraints. These models do not satisfy the lattice-theoretic properties required in our previous work. For a selection of genome-scale metabolic network reconstructions, we discuss both theoretically and practically, how thermodynamic constraints strengthen the coupling results that can be obtained with classical FCA. A prototype implementation of tFCA is available at http://hoverboard.io/L4FC.