Dynamic regulatory on/off minimization for biological systems under internal temporal perturbations

<p>Abstract</p> <p>Background</p> <p>Flux balance analysis (FBA) together with its extension, dynamic FBA, have proven instrumental for analyzing the robustness and dynamics of metabolic networks by employing only the stoichiometry of the included reactions coupled with adequately chosen objective function. In addition, under the assumption of minimization of metabolic adjustment, dynamic FBA has recently been employed to analyze the transition between metabolic states.</p> <p>Results</p> <p>Here, we propose a suite of novel methods for analyzing the dynamics of (internally perturbed) metabolic networks and for quantifying their robustness with limited knowledge of kinetic parameters. Following the biochemically meaningful premise that metabolite concentrations exhibit smooth temporal changes, the proposed methods rely on minimizing the significant fluctuations of metabolic profiles to predict the time-resolved metabolic state, characterized by both fluxes and concentrations. By conducting a comparative analysis with a kinetic model of the Calvin-Benson cycle and a model of plant carbohydrate metabolism, we demonstrate that the principle of regulatory on/off minimization coupled with dynamic FBA can accurately predict the changes in metabolic states.</p> <p>Conclusions</p> <p>Our methods outperform the existing dynamic FBA-based modeling alternatives, and could help in revealing the mechanisms for maintaining robustness of dynamic processes in metabolic networks over time.</p

Networked buffering: a basic mechanism for distributed robustness in complex adaptive systems

A generic mechanism - networked buffering - is proposed for the generation of robust traits in complex systems. It requires two basic conditions to be satisfied: 1) agents are versatile enough to perform more than one single functional role within a system and 2) agents are degenerate, i.e. there exists partial overlap in the functional capabilities of agents. Given these prerequisites, degenerate systems can readily produce a distributed systemic response to local perturbations. Reciprocally, excess resources related to a single function can indirectly support multiple unrelated functions within a degenerate system. In models of genome:proteome mappings for which localized decision-making and modularity of genetic functions are assumed, we verify that such distributed compensatory effects cause enhanced robustness of system traits. The conditions needed for networked buffering to occur are neither demanding nor rare, supporting the conjecture that degeneracy may fundamentally underpin distributed robustness within several biotic and abiotic systems. For instance, networked buffering offers new insights into systems engineering and planning activities that occur under high uncertainty. It may also help explain recent developments in understanding the origins of resilience within complex ecosystems. \ud \u

Gene regulatory network inference from perturbed time-series expression data via ordered dynamical expansion of non-steady state actors

The reconstruction of gene regulatory networks from gene expression data has been the subject of intense research activity. A variety of models and methods have been developed to address different aspects of this important problem. However, these techniques are narrowly focused on particular biological and experimental platforms, and require experimental data that are typically unavailable and difficult to ascertain. The more recent availability of higher-throughput sequencing platforms, combined with more precise modes of genetic perturbation, presents an opportunity to formulate more robust and comprehensive approaches to gene network inference. Here, we propose a step-wise framework for identifying gene-gene regulatory interactions that expand from a known point of genetic or chemical perturbation using time series gene expression data. This novel approach sequentially identifies non-steady state genes post-perturbation and incorporates them into a growing series of low-complexity optimization problems. The governing ordinary differential equations of this model are rooted in the biophysics of stochastic molecular events that underlie gene regulation, delineating roles for both protein and RNA-mediated gene regulation. We show the successful application of our core algorithms for network inference using simulated and real datasets

Network design meets in silico evolutionary biology

Cell fate is programmed through gene regulatory networks that perform several calculations to take the appropriate decision. In silico evolutionary optimization mimics the way Nature has designed such gene regulatory networks. In this review we discuss the basic principles of these evolutionary approaches and how they can be applied to engineer synthetic networks. We summarize the basic guidelines to implement an in silico evolutionary design method, the operators for mutation and selection that iteratively drive the network architecture towards a specified dynamical behavior. Interestingly, as it happens in natural evolution, we show the existence of patterns of punctuated evolution. In addition, we highlight several examples of models that have been designed using automated procedures, together with different objective functions to select for the proper behavior. Finally, we briefly discuss the modular designability of gene regulatory networks and its potential application in biotechnology.Supported by fellowships from Generalitat Valenciana and the European Molecular Biology Organization to G. R. and by grants from the Spanish Ministerio de Ciencia e Innovación to J.C. and S.F.E.Peer reviewe

Dynamic modeling of gene expression in prokaryotes: application to glucose-lactose diauxie in Escherichia coli

Coexpression of genes or, more generally, similarity in the expression profiles poses an unsurmountable obstacle to inferring the gene regulatory network (GRN) based solely on data from DNA microarray time series. Clustering of genes with similar expression profiles allows for a course-grained view of the GRN and a probabilistic determination of the connectivity among the clusters. We present a model for the temporal evolution of a gene cluster network which takes into account interactions of gene products with genes and, through a non-constant degradation rate, with other gene products. The number of model parameters is reduced by using polynomial functions to interpolate temporal data points. In this manner, the task of parameter estimation is reduced to a system of linear algebraic equations, thus making the computation time shorter by orders of magnitude. To eliminate irrelevant networks, we test each GRN for stability with respect to parameter variations, and impose restrictions on its behavior near the steady state. We apply our model and methods to DNA microarray time series' data collected on Escherichia coli during glucose-lactose diauxie and infer the most probable cluster network for different phases of the experiment.Comment: 20 pages, 4 figures; Systems and Synthetic Biology 5 (2011

Hybrid of ant colony optimization and flux variability analysis for improving metabolites production

Metabolic engineering has been successfully used for the production of a variety of useful compounds such as L-phenylalanine and biohydrogen that received high demand on food, pharmaceutical, fossil fuels, and energy industries. Reaction deletion is one of the strategies of in silico metabolic engineering that can alter the metabolism of microbial cells with the objective to get the desired phenotypes. However, due to the size and complexity of metabolic networks, it is difficult to determine the near-optimal set of reactions to be knocked out. The complexity of the metabolic network is also caused by the presence of competing pathway that may interrupt the high production of a desireable metabolite. Consequently, this factor leads to low Biomass-Product Coupled Yield (BPCY), production rate and growth rate. Other than that, inefficiency of existing algorithms in modelling high growth rate and production rate is another problem that should be handled and solved. Therefore, this research proposed a hybrid algorithm comprising Ant Colony Optimization and Flux Variability Analysis (ACOFVA) to identify the best reaction combination to be knocked out to improve the production of desired metabolites in microorganisms. Based on the experimental results, ACOFVA shows an increase in terms of BPCY and production rate of L-Phenylalanine in Yeast and biohydrogen in Cyanobacteria, while maintaining the optimal growth rate for the target organism. Besides, suggested reactions to be knocked out for improving the production yield of L-Phenylalanine and biohydrogen have been identified and validated through the biological database. The algorithm also shows a good performance with better production rate and BPCY of L-Phenylalanine and biohydrogen than existing results

Inferring Drosophila gap gene regulatory network: a parameter sensitivity and perturbation analysis

<p>Abstract</p> <p>Background</p> <p>Inverse modelling of gene regulatory networks (GRNs) capable of simulating continuous spatio-temporal biological processes requires accurate data and a good description of the system. If quantitative relations between genes cannot be extracted from direct measurements, an efficient method to estimate the unknown parameters is mandatory. A model that has been proposed to simulate spatio-temporal gene expression patterns is the connectionist model. This method describes the quantitative dynamics of a regulatory network in space. The model parameters are estimated by means of model-fitting algorithms. The gene interactions are identified without making any prior assumptions concerning the network connectivity. As a result, the inverse modelling might lead to multiple circuits showing the same quantitative behaviour and it is not possible to identify one optimal circuit. Consequently, it is important to address the quality of the circuits in terms of model robustness.</p> <p>Results</p> <p>Here we investigate the sensitivity and robustness of circuits obtained from reverse engineering a model capable of simulating measured gene expression patterns. As a case study we use the early gap gene segmentation mechanism in <it>Drosophila melanogaster</it>. We consider the limitations of the connectionist model used to describe GRN Inferred from spatio-temporal gene expression. We address the problem of circuit discrimination, where the selection criterion within the optimization technique is based of the least square minimization on the error between data and simulated results.</p> <p>Conclusion</p> <p>Parameter sensitivity analysis allows one to discriminate between circuits having significant parameter and qualitative differences but exhibiting the same quantitative pattern. Furthermore, we show that using a stochastic model derived from a deterministic solution, one can introduce fluctuations within the model to analyze the circuits' robustness. Ultimately, we show that there is a close relation between circuit sensitivity and robustness to fluctuation, and that circuit robustness is rather modular than global. The current study shows that reverse engineering of GRNs should not only focus on estimating parameters by minimizing the difference between observation and simulation but also on other model properties. Our study suggests that multi-objective optimization based on robustness and sensitivity analysis has to be considered.</p