Chaotic motifs in gene regulatory networks

Chaos should occur often in gene regulatory networks (GRNs) which have been widely described by nonlinear coupled ordinary differential equations, if their dimensions are no less than 3. It is therefore puzzling that chaos has never been reported in GRNs in nature and is also extremely rare in models of GRNs. On the other hand, the topic of motifs has attracted great attention in studying biological networks, and network motifs are suggested to be elementary building blocks that carry out some key functions in the network. In this paper, chaotic motifs (subnetworks with chaos) in GRNs are systematically investigated. The conclusion is that: (i) chaos can only appear through competitions between different oscillatory modes with rivaling intensities. Conditions required for chaotic GRNs are found to be very strict, which make chaotic GRNs extremely rare. (ii) Chaotic motifs are explored as the simplest few-node structures capable of producing chaos, and serve as the intrinsic source of chaos of random few-node GRNs. Several optimal motifs causing chaos with atypically high probability are figured out. (iii) Moreover, we discovered that a number of special oscillators can never produce chaos. These structures bring some advantages on rhythmic functions and may help us understand the robustness of diverse biological rhythms. (iv) The methods of dominant phase-advanced driving (DPAD) and DPAD time fraction are proposed to quantitatively identify chaotic motifs and to explain the origin of chaotic behaviors in GRNs.     

Cell shape and negative links in regulatory motifs together control spatial information flow in signaling networks

The role of cell size and shape in controlling local intracellular signaling reactions, and how this spatial information originates and is propagated, is not well understood. We have used partial differential equations to model the flow of spatial information from the beta-adrenergic receptor to MAPK1,2 through the cAMP/PKA/B-Raf/MAPK1,2 network in neurons using real geometries. The numerical simulations indicated that cell shape controls the dynamics of local biochemical activity of signal-modulated negative regulators, such as phosphodiesterases and protein phosphatases within regulatory loops to determine the size of microdomains of activated signaling components. The model prediction that negative regulators control the flow of spatial information to downstream components was verified experimentally in rat hippocampal slices. These results suggest a mechanism by which cellular geometry, the presence of regulatory loops with negative regulators, and key reaction rates all together control spatial information transfer and microdomain characteristics within cells.     

From components to regulatory motifs in signalling networks.

The developments in biochemistry and molecular biology over the past 30 years have produced an impressive parts list of cellular components. It has become increasingly clear that we need to understand how components come together to form systems. One area where this approach has been growing is cell signalling research. Here, instead of focusing on individual or small groups of signalling proteins, researchers are now using a more holistic perspective. This approach attempts to view how many components are working together in concert to process information and to orchestrate cellular phenotypic changes. Additionally, the advancements in experimental techniques to measure and visualize many cellular components at once gradually grow in diversity and accuracy. The multivariate data, produced by experiments, introduce new and exciting challenges for computational biologists, who develop models of cellular systems made up of interacting cellular components. The integration of high-throughput experimental results and information from legacy literature is expected to produce computational models that would rapidly enhance our understanding of the detail workings of mammalian cells.     

Inferring gene regulatory networks from multiple microarray datasets

MOTIVATION: Microarray gene expression data has increasingly become the common data source that can provide insights into biological processes at a system-wide level. One of the major problems with microarrays is that a dataset consists of relatively few time points with respect to a large number of genes, which makes the problem of inferring gene regulatory network an ill-posed one. On the other hand, gene expression data generated by different groups worldwide are increasingly accumulated on many species and can be accessed from public databases or individual websites, although each experiment has only a limited number of time-points. RESULTS: This paper proposes a novel method to combine multiple time-course microarray datasets from different conditions for inferring gene regulatory networks. The proposed method is called GNR (Gene Network Reconstruction tool) which is based on linear programming and a decomposition procedure. The method theoretically ensures the derivation of the most consistent network structure with respect to all of the datasets, thereby not only significantly alleviating the problem of data scarcity but also remarkably improving the prediction reliability. We tested GNR using both simulated data and experimental data in yeast and Arabidopsis. The result demonstrates the effectiveness of GNR in terms of predicting new gene regulatory relationship in yeast and Arabidopsis. AVAILABILITY: The software is available from http://zhangorup.aporc.org/bioinfo/grninfer/, http://digbio.missouri.edu/grninfer/ and http://intelligent.eic.osaka-sandai.ac.jp or upon request from the authors.     

An approach to evaluate the topological significance of motifs and other patterns in regulatory networks

Background  

The identification of network motifs as statistically over-represented topological patterns has become one of the most promising topics in the analysis of complex networks. The main focus is commonly made on how they operate by means of their internal organization. Yet, their contribution to a network's global architecture is poorly understood. However, this requires switching from the abstract view of a topological pattern to the level of its instances. Here, we show how a recently proposed metric, the pairwise disconnectivity index, can be adapted to survey if and which kind of topological patterns and their instances are most important for sustaining the connectivity within a network.     

Counting motifs in dynamic networks

Background

A network motif is a sub-network that occurs frequently in a given network. Detection of such motifs is important since they uncover functions and local properties of the given biological network. Finding motifs is however a computationally challenging task as it requires solving the costly subgraph isomorphism problem. Moreover, the topology of biological networks change over time. These changing networks are called dynamic biological networks. As the network evolves, frequency of each motif in the network also changes. Computing the frequency of a given motif from scratch in a dynamic network as the network topology evolves is infeasible, particularly for large and fast evolving networks.

Results

In this article, we design and develop a scalable method for counting the number of motifs in a dynamic biological network. Our method incrementally updates the frequency of each motif as the underlying network’s topology evolves. Our experiments demonstrate that our method can update the frequency of each motif in orders of magnitude faster than counting the motif embeddings every time the network changes. If the network evolves more frequently, the margin with which our method outperforms the existing static methods, increases.

Conclusions

We evaluated our method extensively using synthetic and real datasets, and show that our method is highly accurate(≥?96%) and that it can be scaled to large dense networks. The results on real data demonstrate the utility of our method in revealing interesting insights on the evolution of biological processes.

     

On finite-horizon control of genetic regulatory networks with multiple hard-constraints

Background

Probabilistic Boolean Networks (PBNs) provide a convenient tool for studying genetic regulatory networks. There are three major approaches to develop intervention strategies: (1) resetting the state of the PBN to a desirable initial state and letting the network evolve from there, (2) changing the steady-state behavior of the genetic network by minimally altering the rule-based structure and (3) manipulating external control variables which alter the transition probabilities of the network and therefore desirably affects the dynamic evolution. Many literatures study various types of external control problems, with a common drawback of ignoring the number of times that external control(s) can be applied.

Results

This paper studies the intervention problem by manipulating multiple external controls in a finite time interval in a PBN. The maximum numbers of times that each control method can be applied are given. We treat the problem as an optimization problem with multi-constraints. Here we introduce an algorithm, the "Reserving Place Algorithm'', to find all optimal intervention strategies. Given a fixed number of times that a certain control method is applied, the algorithm can provide all the sub-optimal control policies. Theoretical analysis for the upper bound of the computational cost is also given. We also develop a heuristic algorithm based on Genetic Algorithm, to find the possible optimal intervention strategy for networks of large size.

Conclusions

Studying the finite-horizon control problem with multiple hard-constraints is meaningful. The problem proposed is NP-hard. The Reserving Place Algorithm can provide more than one optimal intervention strategies if there are. Moreover, the algorithm can find all the sub-optimal control strategies corresponding to the number of times that certain control method is conducted. To speed up the computational time, a heuristic algorithm based on Genetic Algorithm is proposed for genetic networks of large size.

     

Dynamic analysis of integrated signaling, metabolic, and regulatory networks

Extracellular cues affect signaling, metabolic, and regulatory processes to elicit cellular responses. Although intracellular signaling, metabolic, and regulatory networks are highly integrated, previous analyses have largely focused on independent processes (e.g., metabolism) without considering the interplay that exists among them. However, there is evidence that many diseases arise from multifunctional components with roles throughout signaling, metabolic, and regulatory networks. Therefore, in this study, we propose a flux balance analysis (FBA)–based strategy, referred to as integrated dynamic FBA (idFBA), that dynamically simulates cellular phenotypes arising from integrated networks. The idFBA framework requires an integrated stoichiometric reconstruction of signaling, metabolic, and regulatory processes. It assumes quasi-steady-state conditions for “fast” reactions and incorporates “slow” reactions into the stoichiometric formalism in a time-delayed manner. To assess the efficacy of idFBA, we developed a prototypic integrated system comprising signaling, metabolic, and regulatory processes with network features characteristic of actual systems and incorporating kinetic parameters based on typical time scales observed in literature. idFBA was applied to the prototypic system, which was evaluated for different environments and gene regulatory rules. In addition, we applied the idFBA framework in a similar manner to a representative module of the single-cell eukaryotic organism Saccharomyces cerevisiae. Ultimately, idFBA facilitated quantitative, dynamic analysis of systemic effects of extracellular cues on cellular phenotypes and generated comparable time-course predictions when contrasted with an equivalent kinetic model. Since idFBA solves a linear programming problem and does not require an exhaustive list of detailed kinetic parameters, it may be efficiently scaled to integrated intracellular systems that incorporate signaling, metabolic, and regulatory processes at the genome scale, such as the S. cerevisiae system presented here.     

Trafficking motifs as the basis for two-compartment signaling systems to form multiple stable states

Transport of molecules in cells is a central part of cell biology. Frequently such trafficking is not just for material transport, but also for information propagation, and serves to couple signaling circuits across cellular compartments. Here, I show that trafficking transforms simple local signaling pathways into self-organizing systems that span compartments and confer distinct states and identities to these compartments. I find that three motifs encapsulate the responses of most single-compartment signaling pathways in the context of trafficking. These motifs combine with different trafficking reactions to generate a diverse set of cellular functions. For example, trafficked bistable switches can oscillate or become quad- or tristable, depending on trafficking mechanisms and rates. Furthermore, the analysis shows how compartments participating in traffic can settle to distinct molecular compositions characteristic of distinct organelle identities. This general framework shows how the interplay between molecular movement and local reactions can generate many system functions, and give distinct identities to different parts of the cell.     

Manipulation of EphB2 regulatory motifs and SH2 binding sites switches MAPK signaling and biological activity

Signaling by the Eph family of receptor tyrosine kinases (RTKs) is complex, because they can interact with a variety of intracellular targets, and can potentially induce distinct responses in different cell types. In NG108 neuronal cells, activated EphB2 recruits p120RasGAP, in a fashion that is associated with down-regulation of the Ras-Erk mitogen-activated kinase (MAPK) pathway and neurite retraction. To pursue the role of the Ras-MAPK pathway in EphB2-mediated growth cone collapse, and to explore the biochemical and biological functions of Eph receptors, we sought to re-engineer the signaling properties of EphB2 by manipulating its regulatory motifs and SH2 binding sites. An EphB2 mutant that retained juxtamembrane (JM) RasGAP binding sites but incorporated a Grb2 binding motif at an alternate RasGAP binding site within the kinase domain had little effect on basal Erk MAPK activation. In contrast, elimination of all RasGAP binding sites, accompanied by the addition of a Grb2 binding site within the kinase domain, led to an increase in phospho-Erk levels in NG108 cells following ephrin-B1 stimulation. Functional assays indicated a correlation between neurite retraction and the ability of the EphB2 mutants to down-regulate Ras-Erk MAPK signaling. These data suggest that EphB2 can be designed to repress, stabilize, or activate the Ras-Erk MAPK pathway by the manipulation of RasGAP and Grb2 SH2 domain binding sites and support the notion that Erk MAPK regulation plays a significant role in axon guidance. The behavior of EphB2 variants with mutations in the JM region and kinase domains suggests an intricate pattern of regulation and target recognition by Eph receptors.