On the long-run sensitivity of probabilistic Boolean networks

Boolean networks and, more generally, probabilistic Boolean networks, as one class of gene regulatory networks, model biological processes with the network dynamics determined by the logic-rule regulatory functions in conjunction with probabilistic parameters involved in network transitions. While there has been significant research on applying different control policies to alter network dynamics as future gene therapeutic intervention, we have seen less work on understanding the sensitivity of network dynamics with respect to perturbations to networks, including regulatory rules and the involved parameters, which is particularly critical for the design of intervention strategies. This paper studies this less investigated issue of network sensitivity in the long run. As the underlying model of probabilistic Boolean networks is a finite Markov chain, we define the network sensitivity based on the steady-state distributions of probabilistic Boolean networks and call it long-run sensitivity. The steady-state distribution reflects the long-run behavior of the network and it can give insight into the dynamics or momentum existing in a system. The change of steady-state distribution caused by possible perturbations is the key measure for intervention. This newly defined long-run sensitivity can provide insight on both network inference and intervention. We show the results for probabilistic Boolean networks generated from random Boolean networks and the results from two real biological networks illustrate preliminary applications of sensitivity in intervention for practical problems.     

Gradient Descent Optimization in Gene Regulatory Pathways

Background

Gene Regulatory Networks (GRNs) have become a major focus of interest in recent years. Elucidating the architecture and dynamics of large scale gene regulatory networks is an important goal in systems biology. The knowledge of the gene regulatory networks further gives insights about gene regulatory pathways. This information leads to many potential applications in medicine and molecular biology, examples of which are identification of metabolic pathways, complex genetic diseases, drug discovery and toxicology analysis. High-throughput technologies allow studying various aspects of gene regulatory networks on a genome-wide scale and we will discuss recent advances as well as limitations and future challenges for gene network modeling. Novel approaches are needed to both infer the causal genes and generate hypothesis on the underlying regulatory mechanisms.

Methodology

In the present article, we introduce a new method for identifying a set of optimal gene regulatory pathways by using structural equations as a tool for modeling gene regulatory networks. The method, first of all, generates data on reaction flows in a pathway. A set of constraints is formulated incorporating weighting coefficients. Finally the gene regulatory pathways are obtained through optimization of an objective function with respect to these weighting coefficients. The effectiveness of the present method is successfully tested on ten gene regulatory networks existing in the literature. A comparative study with the existing extreme pathway analysis also forms a part of this investigation. The results compare favorably with earlier experimental results. The validated pathways point to a combination of previously documented and novel findings.

Conclusions

We show that our method can correctly identify the causal genes and effectively output experimentally verified pathways. The present method has been successful in deriving the optimal regulatory pathways for all the regulatory networks considered. The biological significance and applicability of the optimal pathways has also been discussed. Finally the usefulness of the present method on genetic engineering is depicted with an example.     

Computational identification of protein-protein interactions in rice based on the predicted rice interactome network

Plant protein-protein interaction networks have not been identified by large-scale experiments. In order to better understand the protein interactions in rice, the Predicted Rice Interactome Network (PRIN; http://bis.zju.edu.cn/prin/) presented 76,585 predicted interactions involving 5,049 rice proteins. After mapping genomic features of rice (GO annotation, subcellular localization prediction, and gene expression), we found that a well-annotated and biologically significant network is rich enough to capture many significant functional linkages within higher-order biological systems, such as pathways and biological processes. Furthermore, we took MADS-box domain-containing proteins and circadian rhythm signaling pathways as examples to demonstrate that functional protein complexes and biological pathways could be effectively expanded in our predicted network. The expanded molecular network in PRIN has considerably improved the capability of these analyses to integrate existing knowledge and provide novel insights into the function and coordination of genes and gene networks.     

Computational neurogenetic modelling: a pathway to new discoveries in genetic neuroscience

The paper presents a methodology for using computational neurogenetic modelling (CNGM) to bring new original insights into how genes influence the dynamics of brain neural networks. CNGM is a novel computational approach to brain neural network modelling that integrates dynamic gene networks with artificial neural network model (ANN). Interaction of genes in neurons affects the dynamics of the whole ANN model through neuronal parameters, which are no longer constant but change as a function of gene expression. Through optimization of interactions within the internal gene regulatory network (GRN), initial gene/protein expression values and ANN parameters, particular target states of the neural network behaviour can be achieved, and statistics about gene interactions can be extracted. In such a way, we have obtained an abstract GRN that contains predictions about particular gene interactions in neurons for subunit genes of AMPA, GABAA and NMDA neuro-receptors. The extent of sequence conservation for 20 subunit proteins of all these receptors was analysed using standard bioinformatics multiple alignment procedures. We have observed abundance of conserved residues but the most interesting observation has been the consistent conservation of phenylalanine (F at position 269) and leucine (L at position 353) in all 20 proteins with no mutations. We hypothesise that these regions can be the basis for mutual interactions. Existing knowledge on evolutionary linkage of their protein families and analysis at molecular level indicate that the expression of these individual subunits should be coordinated, which provides the biological justification for our optimized GRN.     

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.     

Renewing the conspiracy theory debate: does Raf function alone to mediate Ras oncogenesis?

Ras proteins function as signal transducers and are mutationally activated in many human cancers. In 1993, Raf was identified as a key downstream effector of Ras signaling, and it was believed then that the primary function of Ras was simply to facilitate Raf activation. However, the subsequent discovery of other proteins that are effectors of Ras function suggested that oncogenic activities of Ras are mediated by both Raf-dependent and Raf-independent signaling. Further complexity arose with the identification of Ras effectors with putative tumor suppressor, rather than oncogenic, functions. However, the recent identification of B-raf mutations in human cancers has renewed the debate regarding whether Raf activation alone promotes Ras-mediated oncogenesis. In this article, we summarize the current knowledge of the contribution of Ras effectors in Ras-mediated oncogenesis.     

Biophysical simulations and structure-based modeling of residue interaction networks in the tumor suppressor proteins reveal functional role of cancer mutation hotspots in molecular communication

In the current study, we have combined molecular simulations and energetic analysis with dynamics-based network modeling and perturbation response scanning to determine molecular signatures of mutational hotspot residues in the p53, PTEN, and SMAD4 tumor suppressor proteins. By examining structure, energetics and dynamics of these proteins, we have shown that inactivating mutations preferentially target a group of structurally stable residues that play a fundamental role in global propagation of dynamic fluctuations and mediating allosteric interaction networks. Through integration of long-range perturbation dynamics and network-based approaches, we have quantified allosteric potential of residues in the studied proteins. The results have revealed that mutational hotspot sites often correspond to high centrality mediating centers of the residue interaction networks that are responsible for coordination of global dynamic changes and allosteric signaling. Our findings have also suggested that structurally stable mutational hotpots can act as major effectors of allosteric interactions and mutations in these positions are typically associated with severe phenotype. Modeling of shortest inter-residue pathways has shown that mutational hotspot sites can also serve as key mediating bridges of allosteric communication in the p53 and PTEN protein structures. Multiple regression models have indicated that functional significance of mutational hotspots can be strongly associated with the network signatures serving as robust predictors of critical regulatory positions responsible for loss-of-function phenotype. The results of this computational investigation are compared with the experimental studies and reveal molecular signatures of mutational hotspots, providing a plausible rationale for explaining and localizing disease-causing mutations in tumor suppressor genes.     

Cancer Gene Discovery Using the Sleeping Beauty Transposon

Epidemiological and molecular data support the hypothesis that cancer results from a series of acquired somatic mutations. Discovering the initial mutations required for oncogenesis has long been a goal of cancer research. To date, the majority of causative mutations have been identified based on their ability to act in a dominant fashion and/or because they are activated by chromosomal translocations. Forward genetic screens are necessary for unbiased discovery of the remaining unknown oncogenic mutations. Two recent projects have demonstrated the feasibility of using the Sleeping Beauty transposon as an insertional mutagen for cancer gene discovery. In this article we discuss the history of cancer gene discovery and propose novel forward genetic screens using Sleeping Beauty transposon aimed at specific tissues and accelerating the discovery of recessive tumor suppressor genes.     

Structure-Based Network Analysis of Activation Mechanisms in the ErbB Family of Receptor Tyrosine Kinases: The Regulatory Spine Residues Are Global Mediators of Structural Stability and Allosteric Interactions

The ErbB protein tyrosine kinases are among the most important cell signaling families and mutation-induced modulation of their activity is associated with diverse functions in biological networks and human disease. We have combined molecular dynamics simulations of the ErbB kinases with the protein structure network modeling to characterize the reorganization of the residue interaction networks during conformational equilibrium changes in the normal and oncogenic forms. Structural stability and network analyses have identified local communities integrated around high centrality sites that correspond to the regulatory spine residues. This analysis has provided a quantitative insight to the mechanism of mutation-induced “superacceptor” activity in oncogenic EGFR dimers. We have found that kinase activation may be determined by allosteric interactions between modules of structurally stable residues that synchronize the dynamics in the nucleotide binding site and the αC-helix with the collective motions of the integrating αF-helix and the substrate binding site. The results of this study have pointed to a central role of the conserved His-Arg-Asp (HRD) motif in the catalytic loop and the Asp-Phe-Gly (DFG) motif as key mediators of structural stability and allosteric communications in the ErbB kinases. We have determined that residues that are indispensable for kinase regulation and catalysis often corresponded to the high centrality nodes within the protein structure network and could be distinguished by their unique network signatures. The optimal communication pathways are also controlled by these nodes and may ensure efficient allosteric signaling in the functional kinase state. Structure-based network analysis has quantified subtle effects of ATP binding on conformational dynamics and stability of the EGFR structures. Consistent with the NMR studies, we have found that nucleotide-induced modulation of the residue interaction networks is not limited to the ATP site, and may enhance allosteric cooperativity with the substrate binding region by increasing communication capabilities of mediating residues.     

The orphan disease networks

The low prevalence rate of orphan diseases (OD) requires special combined efforts to improve diagnosis, prevention, and discovery of novel therapeutic strategies. To identify and investigate relationships based on shared genes or shared functional features, we have conducted a bioinformatic-based global analysis of all orphan diseases with known disease-causing mutant genes. Starting with a bipartite network of known OD and OD-causing mutant genes and using the human protein interactome, we first construct and topologically analyze three networks: the orphan disease network, the orphan disease-causing mutant gene network, and the orphan disease-causing mutant gene interactome. Our results demonstrate that in contrast to the common disease-causing mutant genes that are predominantly nonessential, a majority of orphan disease-causing mutant genes are essential. In confirmation of this finding, we found that OD-causing mutant genes are topologically important in the protein interactome and are ubiquitously expressed. Additionally, functional enrichment analysis of those genes in which mutations cause ODs shows that a majority result in premature death or are lethal in the orthologous mouse gene knockout models. To address the limitations of traditional gene-based disease networks, we also construct and analyze OD networks on the basis of shared enriched features (biological processes, cellular components, pathways, phenotypes, and literature citations). Analyzing these functionally-linked OD networks, we identified several additional OD-OD relations that are both phenotypically similar and phenotypically diverse. Surprisingly, we observed that the wiring of the gene-based and other feature-based OD networks are largely different; this suggests that the relationship between ODs cannot be fully captured by the gene-based network alone.     

Towards more biological mutation operators in gene regulation studies

Genetic regulation is often viewed as a complex system whose properties emerge from the interaction of regulatory genes. One major paradigm for studying the complex dynamics of gene regulation uses directed graphs to explore structure, behaviour and evolvability. Mutation operators used in such studies typically involve the insertion and deletion of nodes, and the insertion, deletion and rewiring of links at the network level. These network-level mutational operators are sufficient to allow the statistical analysis of network structure, but impose limitations on the way networks are evolved. There are a wide variety of mutations in DNA sequences that have yet to be analysed for their network-level effects. By modelling an artificial genome at the level of nucleotide sequences and mapping it to a regulatory network, biologically grounded mutation operators can be mapped to network-level mutations. This paper analyses five such sequence level mutations (single-point mutation, transposition, inversion, deletion and gene duplication) for their effects at the network level. Using analytic and simulation techniques, we show that it is rarely the case that nodes and links are cleanly added or deleted, with even the simplest point mutation causing a wide variety of network-level modifications. As expected, the vast majority of simple (single-point) mutations are neutral, resulting in a neutral plateau from which a range of functional behaviours can be reached. By analysing the effects of sequence-level mutations at the network level of gene regulation, we aim to stimulate more careful consideration of mutation operators in gene regulation models than has previously been given.     

Functional topology in a network of protein interactions

MOTIVATION: The building blocks of biological networks are individual protein-protein interactions (PPIs). The cumulative PPI data set in Saccharomyces cerevisiae now exceeds 78 000. Studying the network of these interactions will provide valuable insight into the inner workings of cells. RESULTS: We performed a systematic graph theory-based analysis of this PPI network to construct computational models for describing and predicting the properties of lethal mutations and proteins participating in genetic interactions, functional groups, protein complexes and signaling pathways. Our analysis suggests that lethal mutations are not only highly connected within the network, but they also satisfy an additional property: their removal causes a disruption in network structure. We also provide evidence for the existence of alternate paths that bypass viable proteins in PPI networks, while such paths do not exist for lethal mutations. In addition, we show that distinct functional classes of proteins have differing network properties. We also demonstrate a way to extract and iteratively predict protein complexes and signaling pathways. We evaluate the power of predictions by comparing them with a random model, and assess accuracy of predictions by analyzing their overlap with MIPS database. CONCLUSIONS: Our models provide a means for understanding the complex wiring underlying cellular function, and enable us to predict essentiality, genetic interaction, function, protein complexes and cellular pathways. This analysis uncovers structure-function relationships observable in a large PPI network.     

Gastric cancer biomarkers; A systems biology approach

Gastric cancer is one of the most fatal cancers in the world. Many efforts in recent years have attempted to find effective proteins in gastric cancer. By using a comprehensive list of proteins involved in gastric cancer, scientists were able to retrieve interaction information. The study of protein-protein interaction networks through systems biology based analysis provides appropriate strategies to discover candidate proteins and key biological pathways.In this study, we investigated dominant functional themes and centrality parameters including betweenness as well as the degree of each topological clusters and expressionally active sub-networks in the resulted network. The results of functional analysis on gene sets showed that neurotrophin signaling pathway, cell cycle and nucleotide excision possess the strongest enrichment signals. According to the computed centrality parameters, HNF4A, TAF1 and TP53 manifested as the most significant nodes in the interaction network of the engaged proteins in gastric cancer. This study also demonstrates pathways and proteins that are applicable as diagnostic markers and therapeutic targets for future attempts to overcome gastric cancer.     

根据在癌突变谱中的共突变基因对识别癌基因

癌是一种涉及多基因变异的遗传异质性疾病,涉及多种生物学功能通路中不同基因的遗传变异。因此,识别癌基因是一项富有挑战性的工作。提出通过寻找在癌样本中突变显著共发生的基因筛选候选癌基因的方法。应用该方法,通过分析蛋白激酶基因在癌组织中的突变谱数据,发现了167个显著共发生突变的基因对,包含85个基因。分析这167个基因对发现:(1)发生共突变的基因富集已知的癌基因;(2)共突变基因对倾向于共扰动与癌症相关的通路对。以上结果提示,在癌样本中显著共发生突变的基因倾向于候选癌基因;在癌发生过程中起重要作用的基因倾向于协同扰动不同的癌相关细胞生物学过程。     

The modularity of biological regulatory networks

A useful approach to complex regulatory networks consists of modeling their elements and interactions by Boolean equations. In this context, feedback circuits (i.e. circular sequences of interactions) have been shown to play key dynamical roles: whereas positive circuits are able to generate multistationarity, negative circuits may generate oscillatory behavior. In this paper, we principally focus on the case of gene networks. These are represented by fully connected Boolean networks where each element interacts with all elements including itself. Flexibility in network design is introduced by the use of Boolean parameters, one associated with each interaction or group of interactions affecting a given element. Within this formalism, a feedback circuit will generate its typical dynamical behavior (i.e. multistationarity or oscillations) only for appropriate values of some of the logical parameters. Whenever it does, we say that the circuit is 'functional'. More interestingly, this formalism allows the computation of the constraints on the logical parameters to have any feedback circuit functional in a network. Using this methodology, we found that the fraction of the total number of consistent combinations of parameter values that make a circuit functional decreases geometrically with the circuit length. From a biological point of view, this suggests that regulatory networks could be decomposed into small and relatively independent feedback circuits or 'regulatory modules'.