Modular decomposition of metabolic reaction networks based on flux analysis and pathway projection

MOTIVATION: The rational decomposition of biochemical networks into sub-structures has emerged as a useful approach to study the design of these complex systems. A biochemical network is characterized by an inhomogeneous connectivity distribution, which gives rise to several organizational features, including modularity. To what extent the connectivity-based modules reflect the functional organization of the network remains to be further explored. In this work, we examine the influence of physiological perturbations on the modular organization of cellular metabolism. RESULTS: Modules were characterized for two model systems, liver and adipocyte primary metabolism, by applying an algorithm for top-down partition of directed graphs with non-uniform edge weights. The weights were set by the engagement of the corresponding reactions as expressed by the flux distribution. For the base case of the fasted rat liver, three modules were found, carrying out the following biochemical transformations: ketone body production, glucose synthesis and transamination. This basic organization was further modified when different flux distributions were applied that describe the liver's metabolic response to whole body inflammation. For the fully mature adipocyte, only a single module was observed, integrating all of the major pathways needed for lipid storage. Weaker levels of integration between the pathways were found for the early stages of adipocyte differentiation. Our results underscore the inhomogeneous distribution of both connectivity and connection strengths, and suggest that global activity data such as the flux distribution can be used to study the organizational flexibility of cellular metabolism. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Modular organization of protein interaction networks

MOTIVATION: Accumulating evidence suggests that biological systems are composed of interacting, separable, functional modules. Identifying these modules is essential to understand the organization of biological systems. RESULT: In this paper, we present a framework to identify modules within biological networks. In this approach, the concept of degree is extended from the single vertex to the sub-graph, and a formal definition of module in a network is used. A new agglomerative algorithm was developed to identify modules from the network by combining the new module definition with the relative edge order generated by the Girvan-Newman (G-N) algorithm. A JAVA program, MoNet, was developed to implement the algorithm. Applying MoNet to the yeast core protein interaction network from the database of interacting proteins (DIP) identified 86 simple modules with sizes larger than three proteins. The modules obtained are significantly enriched in proteins with related biological process Gene Ontology terms. A comparison between the MoNet modules and modules defined by Radicchi et al. (2004) indicates that MoNet modules show stronger co-clustering of related genes and are more robust to ties in betweenness values. Further, the MoNet output retains the adjacent relationships between modules and allows the construction of an interaction web of modules providing insight regarding the relationships between different functional modules. Thus, MoNet provides an objective approach to understand the organization and interactions of biological processes in cellular systems. AVAILABILITY: MoNet is available upon request from the authors.     

Modular organization of protein interaction networks

Bioinformatics (2007) 23(2),     

Modular metabolic control analysis of large responses

Deciphering the laws that govern metabolic responses of complex systems is essential to understand physiological functioning, pathological conditions and the outcome of experimental manipulations of intact cells. To this aim, a theoretical and experimental sensitivity analysis, called modular metabolic control analysis (MMCA), was proposed. This field was previously developed under the assumptions of infinitesimal changes and/or proportionality between parameters and rates, which are usually not fulfilled in vivo. Here we develop a general MMCA for two modules, not relying on those assumptions. Control coefficients and elasticity coefficients for large changes are defined. These are subject to constraints: summation and response theorems, and relationships that allow calculating control from elasticity coefficients. We show how to determine the coefficients from top-down experiments, measuring the rates of the isolated modules as a function of the linking intermediate (there is no need to change parameters inside the modules). The novel formalism is applied to data of two experimental studies from the literature. In one of these, 40% increase in the activity of the supply module results in less than 4% increase in flux, while infinitesimal MMCA predicts more than 30% increase in flux. In addition, it is not possible to increase the flux by manipulating the activity of demand. The impossibility of increasing the flux by changing the activity of a single module is due to an abrupt decrease of the control of the modules when their corresponding activities are increased. In these cases, the infinitesimal approach can give highly erroneous predictions.     

Modular response analysis of cellular regulatory networks

The sheer complexity of intracellular regulatory networks, which involve signal transducing, metabolic, and genetic circuits, hampers our ability to carry out a quantitative analysis of their functions. Here, we describe an approach that greatly simplifies this type of analysis by capitalizing on the modular organization of such networks. Steady-state responses of the network as a whole are accounted for in terms of intermodular interactions between the modules alone; processes operating solely within modules need not be considered when analysing signal transfer through the entire network. The intermodular interactions are quantified through (local) response coefficients which populate an interaction map (matrix). This matrix can be derived from a biochemical or molecular biological analysis of (macro) molecular interactions that constitute the regulatory network. The approach is illustrated by two examples: (i) mitogenic signalling through the mitogen-activated protein kinase cascade in the epidermal growth factor receptor network and (ii) regulation of ammonium assimilation in Escherichia coli.     

Modular decomposition of metabolic systems via null-space analysis

We describe a method by which the reactions in a metabolic system may be grouped hierarchically into sets of modules to form a metabolic reaction tree. In contrast to previous approaches, the method described here takes into account the fact that, in a viable network, reactions must be capable of sustaining a steady-state flux. In order to achieve this decomposition we introduce a new concept--the reaction correlation coefficient, phi, and show that this is a logical extension of the concept of enzyme (or reaction) subsets. In addition to their application to modular decomposition, reaction correlation coefficients have a number of other interesting properties, including a convenient means for identifying disconnected subnetworks in a system and potential applications to metabolic engineering. The method computes reaction correlation coefficients from an orthonormal basis of the null-space of the stoichiometry matrix. We show that reaction correlation coefficients are uniquely defined, even though the basis of the null-space is not. Once a complete set of reaction correlation coefficients is calculated, a metabolic reaction tree can be determined through the application of standard programming techniques. Computation of the reaction correlation coefficients, and the subsequent construction of the metabolic reaction tree is readily achievable for genome-scale models using a commodity desk-top PC.     

Modular neural networks: a survey.

Modular Neural Networks (MNNs) is a rapidly growing field in artificial Neural Networks (NNs) research. This paper surveys the different motivations for creating MNNs: biological, psychological, hardware, and computational. Then, the general stages of MNN design are outlined and surveyed as well, viz., task decomposition techniques, learning schemes and multi-module decision-making strategies. Advantages and disadvantages of the surveyed methods are pointed out, and an assessment with respect to practical potential is provided. Finally, some general recommendations for future designs are presented.     

Modular engineering of cellular signaling proteins and networks

Living cells respond to their environment using networks of signaling molecules that act as sensors, information processors, and actuators. These signaling systems are highly modular at both the molecular and network scales, and much evidence suggests that evolution has harnessed this modularity to rewire and generate new physiological behaviors. Conversely, we are now finding that, following nature's example, signaling modules can be recombined to form synthetic tools for monitoring, interrogating, and controlling the behavior of cells. Here we highlight recent progress in the modular design of synthetic receptors, optogenetic switches, and phospho-regulated proteins and circuits, and discuss the expanding role of combinatorial design in the engineering of cellular signaling proteins and networks.     

Ensemble modeling of metabolic networks

Complete modeling of metabolic networks is desirable, but it is difficult to accomplish because of the lack of kinetics. As a step toward this goal, we have developed an approach to build an ensemble of dynamic models that reach the same steady state. The models in the ensemble are based on the same mechanistic framework at the elementary reaction level, including known regulations, and span the space of all kinetics allowable by thermodynamics. This ensemble allows for the examination of possible phenotypes of the network upon perturbations, such as changes in enzyme expression levels. The size of the ensemble is reduced by acquiring data for such perturbation phenotypes. If the mechanistic framework is approximately accurate, the ensemble converges to a smaller set of models and becomes more predictive. This approach bypasses the need for detailed characterization of kinetic parameters and arrives at a set of models that describes relevant phenotypes upon enzyme perturbations.     

Mass-balanced randomization of metabolic networks

MOTIVATION: Network-centered studies in systems biology attempt to integrate the topological properties of biological networks with experimental data in order to make predictions and posit hypotheses. For any topology-based prediction, it is necessary to first assess the significance of the analyzed property in a biologically meaningful context. Therefore, devising network null models, carefully tailored to the topological and biochemical constraints imposed on the network, remains an important computational problem. RESULTS: We first review the shortcomings of the existing generic sampling scheme-switch randomization-and explain its unsuitability for application to metabolic networks. We then devise a novel polynomial-time algorithm for randomizing metabolic networks under the (bio)chemical constraint of mass balance. The tractability of our method follows from the concept of mass equivalence classes, defined on the representation of compounds in the vector space over chemical elements. We finally demonstrate the uniformity of the proposed method on seven genome-scale metabolic networks, and empirically validate the theoretical findings. The proposed method allows a biologically meaningful estimation of significance for metabolic network properties.     

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.     

Optimization strategies for metabolic networks

Background  

The increasing availability of models and data for metabolic networks poses new challenges in what concerns optimization for biological systems. Due to the high level of complexity and uncertainty associated to these networks the suggested models often lack detail and liability, required to determine the proper optimization strategies. A possible approach to overcome this limitation is the combination of both kinetic and stoichiometric models. In this paper three control optimization methods, with different levels of complexity and assuming various degrees of process information, are presented and their results compared using a prototype network.