inherent-dynamics-visualizer-an-interactive-application-for

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Developing gene regulatory network models is a major challenge in systems biology. Several computational tools and pipelines have been developed to tackle ...

Montana State University

Many arthropods use filiform hairs as mechanoreceptors to detect air motion. In common house crickets (Acheta domestica) the hairs cover two antenna-like appendages called cerci at the rear of the abdomen. The biomechanical stimulus-response properties of individual filiform hairs have been investigated and modeled extensively in several earlier studies. However, only a few previous studies have considered viscosity-mediated coupling between pairs of hairs, and only in particular configurations. Here, we present a model capable of calculating hair-to-hair coupling in arbitrary configurations. We simulate the coupled motion of a small group of mechanosensory hairs on a cylindrical section of cercus. We have found that the coupling effects are non-negligible, and likely constrain the operational characteristics of the cercal sensory array.

Interaction between arthropod filiform hairs in a fluid environment.

A significant conceptual difficulty in the use of switching systems to model regulatory networks is the presence of so-called "black walls," co-dimension 1 regions of phase space with a vector field pointing inward on both sides of the hyperplane. Black walls result from the existence of direct negative self-regulation in the system. One biologically inspired way of removing black walls is the introduction of intermediate variables that mediate the negative self-regulation. In this paper, we study such a perturbation. We replace a switching system with a higher-dimensional switching system with rapidly decaying intermediate proteins, and compare the dynamics between the two systems. We find that the while the individual solutions of the original system can be approximated for a finite time by solutions of a sufficiently close perturbed system, there are always solutions that are not well approximated for any fixed perturbation. We also study a particular example, where global basins of attraction of the perturbed system have a strikingly different form than those of the original system. We perform this analysis using techniques that are adapted to dealing with non-smooth systems.

Convergence Properties of Posttranslationally Modified Protein-Protein Switching Networks with Fast Decay Rates.

We present a new modeling and computational tool that computes rigorous summaries of network dynamics over large sets of parameter values. These summaries, organized in a database, can be searched for observed dynamics, e.g., bistability and hysteresis, to discover parameter regimes over which they are supported. We illustrate our approach on several networks underlying the restriction point of the cell cycle in humans and yeast. We rank networks by how robustly they support hysteresis, which is the observed phenotype. We find that the best 6-node human network and the yeast network share similar topology and robustness of hysteresis, in spite of having no homology between the corresponding nodes of the network. Our approach provides a new tool linking network structure and dynamics.

Identifying robust hysteresis in networks.

Switching systems use piecewise constant nonlinearities to model gene regulatory networks. This choice provides advantages in the analysis of behavior and allows the global description of dynamics in terms of Morse graphs associated to nodes of a parameter graph. The parameter graph captures spatial characteristics of a decomposition of parameter space into domains with identical Morse graphs. However, there are many cellular processes that do not exhibit threshold-like behavior and thus are not well described by a switching system. We consider a class of extensions of switching systems formed by a mixture of switching interactions and chains of variables governed by linear differential equations. We show that the parameter graphs associated to the switching system and any of its extensions are identical. For each parameter graph node, there is an order-preserving map from the Morse graph of the switching system to the Morse graph of any of its extensions. We provide counterexamples that show why possible stronger relationships between the Morse graphs are not valid.

Global dynamics for switching systems and their extensions by linear differential equations.

We present a computational tool DSGRN for exploring the dynamics of a network by computing summaries of the dynamics of switching models compatible with the network across all parameters. The network can arise directly from a biological problem, or indirectly as the interaction graph of a Boolean model. This tool computes a finite decomposition of parameter space such that for each region, the state transition graph that describes the coarse dynamical behavior of a network is the same. Each of these parameter regions corresponds to a different logical description of the network dynamics. The comparison of dynamics across parameters with experimental data allows the rejection of parameter regimes or entire networks as viable models for representing the underlying regulatory mechanisms. This in turn allows a search through the space of perturbations of a given network for networks that robustly fit the data. These are the first steps toward discovering a network that optimally matches the observed dynamics by searching through the space of networks.

DSGRN: Examining the Dynamics of Families of Logical Models.

Ecologists regularly use animal contact networks to describe interactions underlying pathogen transmission, gene flow, and information transfer. However, empirical descriptions of contact often overlook some features of individual movement, and decisions about what kind of network to use in a particular setting are commonly  Here, we relate individual movement trajectories to contact networks through a tripartite network model of individual, space, and time nodes. Most networks used in animal contact studies (e.g. individual association networks, home range overlap networks, and spatial networks) are simplifications of this tripartite model. The tripartite structure can incorporate a broad suite of alternative ecological metrics like home range sizes and patch occupancy patterns into inferences about contact network metrics such as modularity and degree distribution. We demonstrate the model's utility with two simulation studies using alternative forms of ecological data to constrain the tripartite network's structure and inform expectations about the harder-to-measure metrics related to contact.

The ecology of movement and behaviour: a saturated tripartite network for describing animal contacts.

We describe the theoretical and computational framework for the Dynamic Signatures for Genetic Regulatory Network ( DSGRN) database. The motivation stems from urgent need to understand the global dynamics of biologically relevant signal transduction/gene regulatory networks that have at least 5 to 10 nodes, involve multiple interactions, and decades of parameters. The input to the database computations is a regulatory network, i.e. a directed graph with edges indicating up or down regulation. A computational model based on switching networks is generated from the regulatory network. The phase space dimension of this model equals the number of nodes and the associated parameter space consists of one parameter for each node (a decay rate), and three parameters for each edge (low level of expression, high level of expression, and threshold at which expression levels change). Since the nonlinearities of switching systems are piece-wise constant, there is a natural decomposition of phase space into cells from which the dynamics can be described combinatorially in terms of a state transition graph. This in turn leads to a compact representation of the global dynamics called an annotated Morse graph that identifies recurrent and nonrecurrent dynamics. The focus of this paper is on the construction of a natural computable finite decomposition of parameter space into domains where the annotated Morse graph description of dynamics is constant. We use this decomposition to construct an SQL database that can be effectively searched for dynamical signatures such as bistability, stable or unstable oscillations, and stable equilibria. We include two simple 3-node networks to provide small explicit examples of the type of information stored in the DSGRN database. To demonstrate the computational capabilities of this system we consider a simple network associated with p53 that involves 5 nodes and a 29-dimensional parameter space.

Combinatorial representation of parameter space for switching networks.

We show how a graph algorithm for finding matching labeled paths in pairs of labeled directed graphs can be used to perform model invalidation for a class of dynamical systems including regulatory network models of relevance to systems biology. In particular, given a partial order of events describing local minima and local maxima of observed quantities from experimental time series data, we produce a labeled directed graph we call the  for which every path from root to leaf corresponds to a plausible sequence of events. We then consider the regulatory network model, which can itself be rendered into a labeled directed graph we call the  via techniques previously developed in computational dynamics. Labels on the pattern graph correspond to experimentally observed events, while labels on the search graph correspond to mathematical facts about the model. We give a theoretical guarantee that failing to find a match invalidates the model. As an application we consider gene regulatory models for the yeast .

Model Rejection and Parameter Reduction via Time Series.

Experimental time series provide an informative window into the underlying dynamical system, and the timing of the extrema of a time series (or its derivative) contains information about its structure. However, the time series often contain significant measurement errors. We describe a method for characterizing a time series for any assumed level of measurement error [Formula: see text] by a sequence of intervals, each of which is guaranteed to contain an extremum for any function that [Formula: see text]-approximates the time series. Based on the merge tree of a continuous function, we define a new object called the normalized branch decomposition, which allows us to compute intervals for any level [Formula: see text]. We show that there is a well-defined total order on these intervals for a single time series, and that it is naturally extended to a partial order across a collection of time series comprising a dataset. We use the order of the extracted intervals in two applications. First, the partial order describing a single dataset can be used to pattern match against switching model output (Cummins et al. in SIAM J Appl Dyn Syst 17(2):1589-1616, 2018), which allows the rejection of a network model. Second, the comparison between graph distances of the partial orders of different datasets can be used to quantify similarity between biological replicates.

Using extremal events to characterize noisy time series.

The transitions between epithelial (E) and mesenchymal (M) cell phenotypes are essential in many biological processes like tissue development and cancer metastasis. Previous studies, both modeling and experimental, suggested that in addition to E and M states, the network responsible for these phenotypes exhibits intermediate phenotypes between E and M states. The number and importance of such states is subject to intense discussion in the epithelial-mesenchymal transition (EMT) community.

Multistability in the epithelial-mesenchymal transition network.

The blood stage of the infection of the malaria parasite  exhibits a 48-hour developmental cycle that culminates in the synchronous release of parasites from red blood cells, which triggers 48-hour fever cycles in the host. This cycle could be driven extrinsically by host circadian processes or by a parasite-intrinsic oscillator. To distinguish between these hypotheses, we examine the  cycle in an in vitro culture system and show that the parasite has molecular signatures associated with circadian and cell cycle oscillators. Each of the four strains examined has a different period, which indicates strain-intrinsic period control. Finally, we demonstrate that parasites have low cell-to-cell variance in cycle period, on par with a circadian oscillator. We conclude that an intrinsic oscillator maintains 's rhythmic life cycle.

An intrinsic oscillator drives the blood stage cycle of the malaria parasite .

Modeling the dynamics of biological networks introduces many challenges, among them the lack of first principle models, the size of the networks, and difficulties with parameterization. Discrete time Boolean networks and related continuous time switching systems provide a computationally accessible way to translate the structure of the network to predictions about the dynamics. Recent work has shown that the parameterized dynamics of switching systems can be captured by a combinatorial object, called a Dynamic Signatures Generated by Regulatory Networks (DSGRN) database, that consists of a parameter graph characterizing a finite parameter space decomposition, whose nodes are assigned a Morse graph that captures global dynamics for all corresponding parameters. We show that for a given network there is a way to associate the same type of object by considering a continuous time ODE system with a continuous right-hand side, which we call an L-system. The main goal of this paper is to compare the two DSGRN databases for the same network. Since the L-systems can be thought of as perturbations (not necessarily small) of the switching systems, our results address the correspondence between global parameterized dynamics of switching systems and their perturbations. We show that, at corresponding parameters, there is an order preserving map from the Morse graph of the switching system to that of the L-system that is surjective on the set of attractors and bijective on the set of fixed-point attractors. We provide important examples showing why this correspondence cannot be strengthened.

Bree Cummins

Department of Mathematical Sciences

Montana State University

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Bree Cummins

.css-o250i3{font-size:18px;font-family:Open Sans,sans-serif;line-height:21.6px;}Department of Mathematical Sciences

Montana State University

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Department of Mathematical Sciences