Dynamics of Influenza Virus and Human Host Interactions During Infection and Replication Cycle

The replication and life cycle of the influenza virus is governed by an intricate network of intracellular regulatory events during infection, including interactions with an even more complex system of biochemical interactions of the host cell. Computational modeling and systems biology have been successfully employed to further the understanding of various biological systems, however, computational studies of the complexity of intracellular interactions during influenza infection is lacking. In this work, we present the first large-scale dynamical model of the infection and replication cycle of influenza, as well as some of its interactions with the host’s signaling machinery. Specifically, we focus on and visualize the dynamics of the internalization and endocytosis of the virus, replication and translation of its genomic components, as well as the assembly of progeny virions. Simulations and analyses of the models dynamics qualitatively reproduced numerous biological phenomena discovered in the laboratory. Finally, comparisons of the dynamics of existing and proposed drugs, our results suggest that a drug targeting PB1:PA would be more efficient than existing Amantadin/Rimantaine or Zanamivir/Oseltamivir.     

Node vulnerability under finite perturbations in complex networks

A measure to quantify vulnerability under perturbations (attacks, failures, large fluctuations) in ensembles (networks) of coupled dynamical systems is proposed. Rather than addressing the issue of how the network properties change upon removal of elements of the graph (the strategy followed by most of the existing methods for studying the vulnerability of a network based on its topology), here a dynamical definition of vulnerability is introduced, referring to the robustness of a collective dynamical state to perturbing events occurring over a fixed topology. In particular, we study how the collective (synchronized) dynamics of a network of chaotic units is disrupted under the action of a finite size perturbation on one of its nodes. Illustrative examples are provided for three systems of identical chaotic oscillators coupled according to three distinct well-known network topologies. A quantitative comparison between the obtained vulnerability rankings and the classical connectivity/centrality rankings is made that yields conclusive results. Possible applications of the proposed strategy and conclusions are also discussed.     

Probabilistic polynomial dynamical systems for reverse engineering of gene regulatory networks

Elucidating the structure and/or dynamics of gene regulatory networks from experimental data is a major goal of systems biology. Stochastic models have the potential to absorb noise, account for un-certainty, and help avoid data overfitting. Within the frame work of probabilistic polynomial dynamical systems, we present an algorithm for the reverse engineering of any gene regulatory network as a discrete, probabilistic polynomial dynamical system. The resulting stochastic model is assembled from all minimal models in the model space and the probability assignment is based on partitioning the model space according to the likeliness with which a minimal model explains the observed data. We used this method to identify stochastic models for two published synthetic network models. In both cases, the generated model retains the key features of the original model and compares favorably to the resulting models from other algorithms.     

Multisite phosphorylation and network dynamics of cyclin-dependent kinase signaling in the eukaryotic cell cycle

Multisite phosphorylation of regulatory proteins has been proposed to underlie ultrasensitive responses required to generate nontrivial dynamics in complex biological signaling networks. We used a random search strategy to analyze the role of multisite phosphorylation of key proteins regulating cyclin-dependent kinase (CDK) activity in a model of the eukaryotic cell cycle. We show that multisite phosphorylation of either CDK, CDC25, wee1, or CDK-activating kinase is sufficient to generate dynamical behaviors including bistability and limit cycles. Moreover, combining multiple feedback loops based on multisite phosphorylation do not destabilize the cell cycle network by inducing complex behavior, but rather increase the overall robustness of the network. In this model we find that bistability is the major dynamical behavior of the CDK signaling network, and that negative feedback converts bistability into limit cycle behavior. We also compare the dynamical behavior of several simplified models of CDK regulation to the fully detailed model. In summary, our findings suggest that multisite phosphorylation of proteins is a critical biological mechanism in generating the essential dynamics and ensuring robust behavior of the cell cycle.     

Boolean network model predicts cell cycle sequence of fission yeast

A Boolean network model of the cell-cycle regulatory network of fission yeast (Schizosaccharomyces Pombe) is constructed solely on the basis of the known biochemical interaction topology. Simulating the model in the computer faithfully reproduces the known activity sequence of regulatory proteins along the cell cycle of the living cell. Contrary to existing differential equation models, no parameters enter the model except the structure of the regulatory circuitry. The dynamical properties of the model indicate that the biological dynamical sequence is robustly implemented in the regulatory network, with the biological stationary state G1 corresponding to the dominant attractor in state space, and with the biological regulatory sequence being a strongly attractive trajectory. Comparing the fission yeast cell-cycle model to a similar model of the corresponding network in S. cerevisiae, a remarkable difference in circuitry, as well as dynamics is observed. While the latter operates in a strongly damped mode, driven by external excitation, the S. pombe network represents an auto-excited system with external damping.     

Preservation of dynamic properties in qualitative modeling frameworks for gene regulatory networks

Mathematical modeling often helps to provide a systems perspective on gene regulatory networks. In particular, qualitative approaches are useful when detailed kinetic information is lacking. Multiple methods have been developed that implement qualitative information in different ways, e.g., in purely discrete or hybrid discrete/continuous models. In this paper, we compare the discrete asynchronous logical modeling formalism for gene regulatory networks due to R. Thomas with piecewise affine differential equation models. We provide a local characterization of the qualitative dynamics of a piecewise affine differential equation model using the discrete dynamics of a corresponding Thomas model. Based on this result, we investigate the consistency of higher-level dynamical properties such as attractor characteristics and reachability. We show that although the two approaches are based on equivalent information, the resulting qualitative dynamics are different. In particular, the dynamics of the piecewise affine differential equation model is not a simple refinement of the dynamics of the Thomas model     

Estimating the Stochastic Bifurcation Structure of Cellular Networks

High throughput measurement of gene expression at single-cell resolution, combined with systematic perturbation of environmental or cellular variables, provides information that can be used to generate novel insight into the properties of gene regulatory networks by linking cellular responses to external parameters. In dynamical systems theory, this information is the subject of bifurcation analysis, which establishes how system-level behaviour changes as a function of parameter values within a given deterministic mathematical model. Since cellular networks are inherently noisy, we generalize the traditional bifurcation diagram of deterministic systems theory to stochastic dynamical systems. We demonstrate how statistical methods for density estimation, in particular, mixture density and conditional mixture density estimators, can be employed to establish empirical bifurcation diagrams describing the bistable genetic switch network controlling galactose utilization in yeast Saccharomyces cerevisiae. These approaches allow us to make novel qualitative and quantitative observations about the switching behavior of the galactose network, and provide a framework that might be useful to extract information needed for the development of quantitative network models.     

From Genes to Flower Patterns and Evolution: Dynamic Models of Gene Regulatory Networks

Genes and proteins form complex dynamical systems or gene regulatory networks (GRN) that can reach several steady states (attractors). These may be associated with distinct cell types. In plants, the ABC combinatorial model establishes the necessary gene combinations for floral organ cell specification. We have developed dynamic gene regulatory network (GRN) models to understand how the combinatorial selection of gene activity is established during floral organ primordia specification as a result of the concerted action of ABC and non-ABC genes. Our analyses have shown that the floral organ specification GRN reaches six attractors with gene configurations observed in primordial cell types during early stages of flower development and four that correspond to regions of the inflorescence meristem. This suggests that it is the overall GRN dynamics rather than precise signals that underlie the ABC model. Furthermore, our analyses suggest that the steady states of the GRN are robust to random alterations of the logical functions that define the gene interactions. Here we have updated the GRN model and have systematically altered the outputs of all the logical functions and addressed in which cases the original attractors are recovered. We then reduced the original three-state GRN to a two-state (Boolean) GRN and performed the same systematic perturbation analysis. Interestingly, the Boolean GRN reaches the same number and type of attractors as reached by the three-state GRN, and it responds to perturbations in a qualitatively identical manner as the original GRN. These results suggest that a Boolean model is sufficient to capture the dynamical features of the floral network and provide additional support for the robustness of the floral GRN. These findings further support that the GRN model provides a dynamical explanation for the ABC model and that the floral GRN robustness could be behind the widespread conservation of the floral plan among eudicotyledoneous plants. Other aspects of evolution of flower organ arrangement and ABC gene expression patterns are discussed in the context of the approach proposed here. álvaro Chaos, Max Aldana and Elena Alvarez-Buylla contributed equally to this work.     

Quantifying the dynamics of coupled networks of switches and oscillators

Complex network dynamics have been analyzed with models of systems of coupled switches or systems of coupled oscillators. However, many complex systems are composed of components with diverse dynamics whose interactions drive the system's evolution. We, therefore, introduce a new modeling framework that describes the dynamics of networks composed of both oscillators and switches. Both oscillator synchronization and switch stability are preserved in these heterogeneous, coupled networks. Furthermore, this model recapitulates the qualitative dynamics for the yeast cell cycle consistent with the hypothesized dynamics resulting from decomposition of the regulatory network into dynamic motifs. Introducing feedback into the cell-cycle network induces qualitative dynamics analogous to limitless replicative potential that is a hallmark of cancer. As a result, the proposed model of switch and oscillator coupling provides the ability to incorporate mechanisms that underlie the synchronized stimulus response ubiquitous in biochemical systems.     

Modeling of Hysteresis in Gene Regulatory Networks

Hysteresis, observed in many gene regulatory networks, has a pivotal impact on biological systems, which enhances the robustness of cell functions. In this paper, a general model is proposed to describe the hysteretic gene regulatory network by combining the hysteresis component and the transient dynamics. The Bouc-Wen hysteresis model is modified to describe the hysteresis component in the mammalian gene regulatory networks. Rigorous mathematical analysis on the dynamical properties of the model is presented to ensure the bounded-input-bounded-output (BIBO) stability and demonstrates that the original Bouc-Wen model can only generate a clockwise hysteresis loop while the modified model can describe both clockwise and counter clockwise hysteresis loops. Simulation studies have shown that the hysteresis loops from our model are consistent with the experimental observations in three mammalian gene regulatory networks and two E.coli gene regulatory networks, which demonstrate the ability and accuracy of the mathematical model to emulate natural gene expression behavior with hysteresis. A comparison study has also been conducted to show that this model fits the experiment data significantly better than previous ones in the literature. The successful modeling of the hysteresis in all the five hysteretic gene regulatory networks suggests that the new model has the potential to be a unified framework for modeling hysteresis in gene regulatory networks and provide better understanding of the general mechanism that drives the hysteretic function.     

Dynamical approaches to modeling developmental gene regulatory networks

The network of interacting regulatory signals within a cell comprises one of the most complex and powerful computational systems in biology. Gene regulatory networks (GRNs) play a key role in transforming the information encoded in a genome into morphological form. To achieve this feat, GRNs must respond to and integrate environmental signals with their internal dynamics in a robust and coordinated fashion. The highly dynamic nature of this process lends itself to interpretation and analysis in the language of dynamical models. Modeling provides a means of systematically untangling the complicated structure of GRNs, a framework within which to simulate the behavior of reconstructed systems and, in some cases, suites of analytic tools for exploring that behavior and its implications. This review provides a general background to the idea of treating a regulatory network as a dynamical system, and describes a variety of different approaches that have been taken to the dynamical modeling of GRNs. Birth Defects Research (Part C) 87:131–142, 2009. © 2009 Wiley‐Liss, Inc.     

Coherent activation of a synthetic mammalian gene network

A quantitative analysis of naturally-occurring regulatory networks, especially those present in mammalian cells, is difficult due to their high complexity. Much simpler gene networks can be engineered in model organisms and analyzed as isolated regulatory modules. Recently, several synthetic networks have been constructed in mammalian systems. However, most of these engineered mammalian networks have been characterized using steady-state population level measurements. Here, we use an integrated experimental-computational approach to analyze the dynamical response of a synthetic positive feedback network in individual mammalian cells. We observe a switch-like activation of the network with variable delay times in individual cells. In agreement with a stochastic model of the network, we find that increasing the strength of the positive feedback results in a decrease in the mean delay time and a more coherent activation of individual cells. Our results are important for gaining insight into biological processes which rely on positive feedback regulation.     

Superstability of the yeast cell-cycle dynamics: ensuring causality in the presence of biochemical stochasticity

Gene regulatory dynamics are governed by molecular processes and therefore exhibits an inherent stochasticity. However, for the survival of an organism it is a strict necessity that this intrinsic noise does not prevent robust functioning of the system. It is still an open question how dynamical stability is achieved in biological systems despite the omnipresent fluctuations. In this paper we investigate the cell cycle of the budding yeast Saccharomyces cerevisiae as an example of a well-studied organism. We study a genetic network model of 11 genes that coordinate the cell-cycle dynamics using a modeling framework which generalizes the concept of discrete threshold dynamics. By allowing for fluctuations in the process times, we introduce noise into the model, accounting for the effects of biochemical stochasticity. We study the dynamical attractor of the cell cycle and find a remarkable robustness against fluctuations of this kind. We identify mechanisms that ensure reliability in spite of fluctuations: 'Catcher states' and persistence of activity levels contribute significantly to the stability of the yeast cell cycle despite the inherent stochasticity.     

Analyzing steady states of dynamics of bio-molecules from the structure of regulatory networks

Regulatory relations between biological molecules constitute complex network systems and realize diverse biological functions through the dynamics of molecular activities. However, we currently have very little understanding of the relationship between the structure of a regulatory network and its dynamical properties. In this paper we introduce a new method, named “linkage logic” to analyze the dynamics of network systems. By this method, we can restrict possible steady states of a given complex network system from the knowledge of regulatory linkages alone. The regulatory linkage simply specifies the list of variables that affect the dynamics of each variable. We formalize two aspects of the linkage logic: the “Principle of Compatibility” determines the upper limit of the diversity of possible steady states of the dynamics realized by a given network; the “Principle of Dependency” determines the possible combinations of states of the system. By combining these two aspects, (i) for a given network, we can identify a cluster of nodes that gives an alternative representation of the steady states of the whole system, (ii) we can reduce a given complex network into a simpler one without loss of the ability to generate the diversity of steady states, (iii) we can examine the consistency between the structure of network and observed set of steady states, and (iv) sometimes we can predict unknown states or unknown regulations from an observed set of steady states alone. We illustrate the method by several applications to an experimentally determined regulatory network for biological functions.     

GDSCalc: A Web-Based Application for Evaluating Discrete Graph Dynamical Systems

Discrete dynamical systems are used to model various realistic systems in network science, from social unrest in human populations to regulation in biological networks. A common approach is to model the agents of a system as vertices of a graph, and the pairwise interactions between agents as edges. Agents are in one of a finite set of states at each discrete time step and are assigned functions that describe how their states change based on neighborhood relations. Full characterization of state transitions of one system can give insights into fundamental behaviors of other dynamical systems. In this paper, we describe a discrete graph dynamical systems (GDSs) application called GDSCalc for computing and characterizing system dynamics. It is an open access system that is used through a web interface. We provide an overview of GDS theory. This theory is the basis of the web application; i.e., an understanding of GDS provides an understanding of the software features, while abstracting away implementation details. We present a set of illustrative examples to demonstrate its use in education and research. Finally, we compare GDSCalc with other discrete dynamical system software tools. Our perspective is that no single software tool will perform all computations that may be required by all users; tools typically have particular features that are more suitable for some tasks. We situate GDSCalc within this space of software tools.     

Dynamics of opinion forming in structurally balanced social networks

A structurally balanced social network is a social community that splits into two antagonistic factions (typical example being a two-party political system). The process of opinion forming on such a community is most often highly predictable, with polarized opinions reflecting the bipartition of the network. The aim of this paper is to suggest a class of dynamical systems, called monotone systems, as natural models for the dynamics of opinion forming on structurally balanced social networks. The high predictability of the outcome of a decision process is explained in terms of the order-preserving character of the solutions of this class of dynamical systems. If we represent a social network as a signed graph in which individuals are the nodes and the signs of the edges represent friendly or hostile relationships, then the property of structural balance corresponds to the social community being splittable into two antagonistic factions, each containing only friends.