Pystablemotifs is a Python 3 library for analyzing Boolean networks. Its non-heuristic and exhaustive attractor identification algorithm was previously presented in Rozum et al. (2021). Here, we illustrate its performance improvements over similar methods and discuss how it uses outputs of the attractor identification process to drive a system to one of its attractors from any initial state. We implement six attractor control algorithms, five of which are new in this work. By design, these algorithms can return different control strategies, allowing for synergistic use. We also give a brief overview of the other tools implemented in pystablemotifs. The source code is on GitHub at https://github.com/jcrozum/pystablemotifs/. Supplementary data are available at Bioinformatics online.
We present new applications of parity inversion and time reversal to the emergence of complex behavior from simple dynamical rules in stochastic discrete models. Our parity-based encoding of causal relationships and time-reversal construction efficiently reveal discrete analogs of stable and unstable manifolds. We demonstrate their predictive power by studying decision-making in systems biology and statistical physics models. These applications underpin a novel attractor identification algorithm implemented for Boolean networks under stochastic dynamics. Its speed enables resolving a long-standing open question of how attractor count in critical random Boolean networks scales with network size and whether the scaling matches biological observations. Via 80-fold improvement in probed network size (N = 16,384), we find the unexpectedly low scaling exponent of 0.12 ± 0.05, approximately one-tenth the analytical upper bound. We demonstrate a general principle: A system’s relationship to its time reversal and state-space inversion constrains its repertoire of emergent behaviors.
Complex living systems are thought to exist at the “edge of chaos” separating the ordered dynamics of robust function from the disordered dynamics of rapid environmental adaptation. Here, a deeper inspection of 72 experimentally supported discrete dynamical models of cell processes reveals previously unobserved order on long time scales, suggesting greater rigidity in these systems than was previously conjectured. We find that propagation of internal perturbations is transient in most cases, and that even when large perturbation cascades persist, their phenotypic effects are often minimal. Moreover, we find evidence that stochasticity and desynchronization can lead to increased recovery from regulatory perturbation cascades. Our analysis relies on new measures that quantify the tendency of perturbations to spread through a discrete dynamical system. Computing these measures was not feasible using current methodology; thus, we developed a multipurpose CUDA-based simulation tool, which we have made available as the open-source Python library cubewalkers. Based on novel measures and simulations, our results suggest that—contrary to current theory—cell processes are ordered and far from the edge of chaos.
We present a technique applicable in any dynamical framework to identify control-robust subsets of an interacting system. These robust subsystems, which we call stable modules, are characterized by constraints on the variables that make up the subsystem. They are robust in the sense that if the defining constraints are satisfied at a given time, they remain satisfied for all later times, regardless of what happens in the rest of the system, and can only be broken if the constrained variables are externally manipulated. We identify stable modules as graph structures in an expanded network, which represents causal links between variable constraints. A stable module represents a system “decision point”, or trap subspace. Using the expanded network, small stable modules can be composed sequentially to form larger stable modules that describe dynamics on the system level. Collections of large, mutually exclusive stable modules describe the system’s repertoire of long-term behaviors. We implement this technique in a broad class of dynamical systems and illustrate its practical utility via examples and algorithmic analysis of two published biological network models. In the segment polarity gene network of Drosophila melanogaster, we obtain a state-space visualization that reproduces by novel means the four possible cell fates and predicts the outcome of cell transplant experiments. In the T-cell signaling network, we identify six signaling elements that determine the high-signal response and show that control of an element connected to them cannot disrupt this response. We show how to uncover the causal relationships between qualitative statements about the values of variables in ODE systems. We then show how these relationships can be used to identify subsystem behaviors that are robust to outside interventions. This informs potential system control strategies (e.g., in identifying drug targets). Typical analytical properties of biomolecular systems render them particularly amenable to our techniques. Furthermore, due to their often high dimension and large uncertainties, our results are particularly useful in biomolecular systems. We apply our methods to two quantitative biological models: the segment polarity gene network of Drosophila melanogaster and the T-cell signal transduction network.
1 October 2022 in npj Systems Biology and Applications
Over the last twenty years, dynamic modeling of biomolecular networks has exploded in popularity. Many of the classical tools for understanding dynamical systems are unwieldy in the highly nonlinear, poorly constrained, high-dimensional systems that often arise from these modeling efforts. Understanding complex biological systems is greatly facilitated by purpose-built methods that leverage common features of such models, such as local monotonicity, interaction graph sparsity, and sigmoidal kinetics. Here, we review methods for controlling the systems of ordinary differential equations used to model biomolecular networks. We focus on methods that make use of the structure of the network of interactions to help inform, which variables to target for control, and highlight the computational and experimental advantages of such approaches. We also discuss the importance of nonperturbative methods in biomedical and experimental molecular biology applications, where finely tuned interventions can be difficult to implement. It is well known that feedback loops, and positive feedback loops in particular, play a major determining role in the dynamics of biomolecular networks. In many of the methods we cover here, control over system trajectories is realized by overriding the behavior of key feedback loops.