In vivo robustness analysis of cell division cycle genes in Saccharomyces cerevisiae

Intracellular biochemical parameters, such as the expression level of gene products, are considered to be optimized so that a biological system, including the parameters, works effectively. Those parameters should have some permissible range so that the systems have robustness against perturbations, such as noise in gene expression. However, little is known about the permissible range in real cells because there has been no experimental technique to test it. In this study, we developed a genetic screening method, named “genetic tug-of-war” (gTOW) that evaluates upper limit copy numbers of genes in a model eukaryote Saccharomyces cerevisiae, and we applied it for 30 cell-cycle related genes (CDC genes). The experiment provided unique quantitative data that could be used to argue the system-level properties of the cell cycle such as robustness and fragility. The data were used to evaluate the current computational model, and refinements to the model were suggested.     

Overexpression limits of fission yeast cell‐cycle regulators in vivo and in silico

Cellular systems are generally robust against fluctuations of intracellular parameters such as gene expression level. However, little is known about expression limits of genes required to halt cellular systems. In this study, using the fission yeast Schizosaccharomyces pombe, we developed a genetic ‘tug‐of‐war’ (gTOW) method to assess the overexpression limit of certain genes. Using gTOW, we determined copy number limits for 31 cell‐cycle regulators; the limits varied from 1 to >100. Comparison with orthologs of the budding yeast Saccharomyces cerevisiae suggested the presence of a conserved fragile core in the eukaryotic cell cycle. Robustness profiles of networks regulating cytokinesis in both yeasts (septation‐initiation network (SIN) and mitotic exit network (MEN)) were quite different, probably reflecting differences in their physiologic functions. Fragility in the regulation of GTPase spg1 was due to dosage imbalance against GTPase‐activating protein (GAP) byr4. Using the gTOW data, we modified a mathematical model and successfully reproduced the robustness of the S. pombe cell cycle with the model.     

Topology of gene expression networks as revealed by data mining and modeling

MOTIVATION: Interpretation of high-throughput gene expression profiling requires a knowledge of the design principles underlying the networks that sustain cellular machinery. Recently a novel approach based on the study of network topologies has been proposed. This methodology has proven to be useful for the analysis of a variety of biological systems, including metabolic networks, networks of protein-protein interactions, and gene networks that can be derived from gene expression data. In the present paper, we focus on several important issues related to the topology of gene expression networks that have not yet been fully studied. RESULTS: The networks derived from gene expression profiles for both time series experiments in yeast and perturbation experiments in cell lines are studied. We demonstrate that independent from the experimental organism (yeast versus cell lines) and the type of experiment (time courses versus perturbations) the extracted networks have similar topological characteristics suggesting together with the results of other common principles of the structural organization of biological networks. A novel computational model of network growth that reproduces the basic design principles of the observed networks is presented. Advantage of the model is that it provides a general mechanism to generate networks with different types of topology by a variation of a few parameters. We investigate the robustness of the network structure to random damages and to deliberate removal of the most important parts of the system and show a surprising tolerance of gene expression networks to both kinds of disturbance.     

Integrated analysis of gene expression and copy number data on gene shaving using independent component analysis

DNA microarray gene expression and microarray-based comparative genomic hybridization (aCGH) have been widely used for biomedical discovery. Because of the large number of genes and the complex nature of biological networks, various analysis methods have been proposed. One such method is "gene shaving," a procedure which identifies subsets of the genes with coherent expression patterns and large variation across samples. Since combining genomic information from multiple sources can improve classification and prediction of diseases, in this paper we proposed a new method, "ICA gene shaving" (ICA, independent component analysis), for jointly analyzing gene expression and copy number data. First we used ICA to analyze joint measurements, gene expression and copy number, of a biological system and project the data onto statistically independent biological processes. Next, we used these results to identify patterns of variation in the data and then applied an iterative shaving method. We investigated the properties of our proposed method by analyzing both simulated and real data. We demonstrated that the robustness of our method to noise using simulated data. Using breast cancer data, we showed that our method is superior to the Generalized Singular Value Decomposition (GSVD) gene shaving method for identifying genes associated with breast cancer.     

Recent Progress on the Analysis of Power-law Features in Complex Cellular Networks

Complex interactions between different kinds of bio-molecules and essential nutrients are responsible for cellular functions. Rapid advances in theoretical modeling and experimental analyses have shown that drastically different biological and non-biological networks share a common architecture. That is, the probability that a selected node in the network has exactly k edges decays as a power-law. This finding has definitely opened an intense research and debate on the origin and implications of this ubiquitous pattern. In this review, we describe the recent progress on the emergence of power-law distributions in cellular networks. We first show the internal characteristics of the observed complex networks uncovered using graph theory. We then briefly review some works that have significantly contributed to the theoretical analysis of cellular networks and systems, from metabolic and protein networks to gene expression profiles. This prevalent topology observed in so many diverse biological systems suggests the existence of generic laws and organizing principles behind the cellular networks.     

Robustness Analysis of Stochastic Biochemical Systems

We propose a new framework for rigorous robustness analysis of stochastic biochemical systems that is based on probabilistic model checking techniques. We adapt the general definition of robustness introduced by Kitano to the class of stochastic systems modelled as continuous time Markov Chains in order to extensively analyse and compare robustness of biological models with uncertain parameters. The framework utilises novel computational methods that enable to effectively evaluate the robustness of models with respect to quantitative temporal properties and parameters such as reaction rate constants and initial conditions. We have applied the framework to gene regulation as an example of a central biological mechanism where intrinsic and extrinsic stochasticity plays crucial role due to low numbers of DNA and RNA molecules. Using our methods we have obtained a comprehensive and precise analysis of stochastic dynamics under parameter uncertainty. Furthermore, we apply our framework to compare several variants of two-component signalling networks from the perspective of robustness with respect to intrinsic noise caused by low populations of signalling components. We have successfully extended previous studies performed on deterministic models (ODE) and showed that stochasticity may significantly affect obtained predictions. Our case studies demonstrate that the framework can provide deeper insight into the role of key parameters in maintaining the system functionality and thus it significantly contributes to formal methods in computational systems biology.     

Gene expression data analysis

Microarrays are one of the latest breakthroughs in experimental molecular biology, which allow monitoring of gene expression for tens of thousands of genes in parallel and are already producing huge amounts of valuable data. Analysis and handling of such data is becoming one of the major bottlenecks in the utilization of the technology. The raw microarray data are images, which have to be transformed into gene expression matrices--tables where rows represent genes, columns represent various samples such as tissues or experimental conditions, and numbers in each cell characterize the expression level of the particular gene in the particular sample. These matrices have to be analyzed further, if any knowledge about the underlying biological processes is to be extracted. In this paper we concentrate on discussing bioinformatics methods used for such analysis. We briefly discuss supervised and unsupervised data analysis and its applications, such as predicting gene function classes and cancer classification. Then we discuss how the gene expression matrix can be used to predict putative regulatory signals in the genome sequences. In conclusion we discuss some possible future directions.     

The Dynamics of Turing Patterns for Morphogen-Regulated Growing Domains with Cellular Response Delays

Since its conception in 1952, the Turing paradigm for pattern formation has been the subject of numerous theoretical investigations. Experimentally, this mechanism was first demonstrated in chemical reactions over 20 years ago and, more recently, several examples of biological self-organisation have also been implicated as Turing systems. One criticism of the Turing model is its lack of robustness, not only with respect to fluctuations in the initial conditions, but also with respect to the inclusion of delays in critical feedback processes such as gene expression. In this work we investigate the possibilities for Turing patterns on growing domains where the morphogens additionally regulate domain growth, incorporating delays in the feedback between signalling and domain growth, as well as gene expression. We present results for the proto-typical Schnakenberg and Gierer–Meinhardt systems: exploring the dynamics of these systems suggests a reconsideration of the basic Turing mechanism for pattern formation on morphogen-regulated growing domains as well as highlighting when feedback delays on domain growth are important for pattern formation.     

Accurate measurements of dynamics and reproducibility in small genetic networks

Quantification of gene expression has become a central tool for understanding genetic networks. In many systems, the only viable way to measure protein levels is by immunofluorescence, which is notorious for its limited accuracy. Using the early Drosophila embryo as an example, we show that careful identification and control of experimental error allows for highly accurate gene expression measurements. We generated antibodies in different host species, allowing for simultaneous staining of four Drosophila gap genes in individual embryos. Careful error analysis of hundreds of expression profiles reveals that less than ～20% of the observed embryo‐to‐embryo fluctuations stem from experimental error. These measurements make it possible to extract not only very accurate mean gene expression profiles but also their naturally occurring fluctuations of biological origin and corresponding cross‐correlations. We use this analysis to extract gap gene profile dynamics with ～1 min accuracy. The combination of these new measurements and analysis techniques reveals a twofold increase in profile reproducibility owing to a collective network dynamics that relays positional accuracy from the maternal gradients to the pair‐rule genes.     

Dynamic properties of network motifs contribute to biological network organization

Biological networks, such as those describing gene regulation, signal transduction, and neural synapses, are representations of large-scale dynamic systems. Discovery of organizing principles of biological networks can be enhanced by embracing the notion that there is a deep interplay between network structure and system dynamics. Recently, many structural characteristics of these non-random networks have been identified, but dynamical implications of the features have not been explored comprehensively. We demonstrate by exhaustive computational analysis that a dynamical property—stability or robustness to small perturbations—is highly correlated with the relative abundance of small subnetworks (network motifs) in several previously determined biological networks. We propose that robust dynamical stability is an influential property that can determine the non-random structure of biological networks.     

Fine-Scale Dissection of Functional Protein Network Organization by Statistical Network Analysis

Revealing organizational principles of biological networks is an important goal of systems biology. In this study, we sought to analyze the dynamic organizational principles within the protein interaction network by studying the characteristics of individual neighborhoods of proteins within the network based on their gene expression as well as protein-protein interaction patterns. By clustering proteins into distinct groups based on their neighborhood gene expression characteristics, we identify several significant trends in the dynamic organization of the protein interaction network. We show that proteins with distinct neighborhood gene expression characteristics are positioned in specific localities in the protein interaction network thereby playing specific roles in the dynamic network connectivity. Remarkably, our analysis reveals a neighborhood characteristic that corresponds to the most centrally located group of proteins within the network. Further, we show that the connectivity pattern displayed by this group is consistent with the notion of “rich club connectivity” in complex networks. Importantly, our findings are largely reproducible in networks constructed using independent and different datasets.     

An integer optimization algorithm for robust identification of non-linear gene regulatory networks

ABSTRACT: BACKGROUND: Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. RESULTS: We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in-silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. CONCLUSIONS: Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system.     

Gene expression data analysis

Microarrays are one of the latest breakthroughs in experimental molecular biology, which allow monitoring of gene expression for tens of thousands of genes in parallel and are already producing huge amounts of valuable data. Analysis and handling of such data is becoming one of the major bottlenecks in the utilization of the technology. The raw microarray data are images, which have to be transformed into gene expression matrices, tables where rows represent genes, columns represent various samples such as tissues or experimental conditions, and numbers in each cell characterize the expression level of the particular gene in the particular sample. These matrices have to be analyzed further if any knowledge about the underlying biological processes is to be extracted. In this paper we concentrate on discussing bioinformatics methods used for such analysis. We briefly discuss supervised and unsupervised data analysis and its applications, such as predicting gene function classes and cancer classification as well as some possible future directions.     

Microarray challenges in ecology

Microarrays are used to measure simultaneously the amount of mRNAs transcribed from many genes. They were originally designed for gene expression profiling in relatively simple biological systems, such as cell lines and model systems under constant laboratory conditions. This poses a challenge to ecologists who increasingly want to use microarrays to unravel the genetic mechanisms underlying complex interactions among organisms and between organisms and their environment. Here, we discuss typical experimental and statistical problems that arise when analyzing genome-wide expression profiles in an ecological context. We show that experimental design and environmental confounders greatly influence the identification of candidate genes in ecological microarray studies, and that following several simple recommendations could facilitate the analysis of microarray data in ecological settings.     

GAGE: generally applicable gene set enrichment for pathway analysis

Background  

Gene set analysis (GSA) is a widely used strategy for gene expression data analysis based on pathway knowledge. GSA focuses on sets of related genes and has established major advantages over individual gene analyses, including greater robustness, sensitivity and biological relevance. However, previous GSA methods have limited usage as they cannot handle datasets of different sample sizes or experimental designs.     

Probabilistic representation of gene regulatory networks

MOTIVATION: Recent experiments have established unambiguously that biological systems can have significant cell-to-cell variations in gene expression levels even in isogenic populations. Computational approaches to studying gene expression in cellular systems should capture such biological variations for a more realistic representation. RESULTS: In this paper, we present a new fully probabilistic approach to the modeling of gene regulatory networks that allows for fluctuations in the gene expression levels. The new algorithm uses a very simple representation for the genes, and accounts for the repression or induction of the genes and for the biological variations among isogenic populations simultaneously. Because of its simplicity, introduced algorithm is a very promising approach to model large-scale gene regulatory networks. We have tested the new algorithm on the synthetic gene network library bioengineered recently. The good agreement between the computed and the experimental results for this library of networks, and additional tests, demonstrate that the new algorithm is robust and very successful in explaining the experimental data. AVAILABILITY: The simulation software is available upon request. SUPPLEMENTARY INFORMATION: Supplementary material will be made available on the OUP server.