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.context of cell biology, the problems of nonlinear dynamics are compounded by the lack of first principles that would determine appropriate nonlinearities, the difficulty in obtaining precise experimental data needed to determine parameters, and the need to analyze the dynamics of 5--10 dimensional systems over 30--50 parameters.Recently, we introduced in [16, 15] a new approach to this problem that assigns two finite objects to any network with positive and negative edges. First is a parameter graph whose nodes are in 1-1 correspondence with regions in the parameter space, where these regions form a decomposition of the parameter space. To each region of the parameter space, i.e., a node of the parameter graph, there is an associated state transition graph that characterizes allowable transitions between well-defined states that partition the phase space. Since state transition graphs can be large, a useful description of the recurrent trajectories is a Morse graph, which is the graph of strongly connected path components of the state transition graph. This information is compiled into a database of Dynamic Signatures Generated by Regulatory Networks (DSGRN database), where to each node of the parameter graph there is an associated Morse graph that captures the recurrent dynamics valid for all parameters in the corresponding parameter region.The advantages of such a description of global dynamics is its finiteness and the resulting computa...
The study of gene regulatory networks has expanded in recent years as an abundance of experimentally derived networks have become publicly available. The sequence of evolutionary steps that produced these networks are usually unknown. As a result, it is challenging to differentiate features that arose through gene duplication and gene interaction removal from features introduced through other mechanisms. We develop tools to distinguish these network features and in doing so, give methods for studying ancestral networks through the analysis of present-day networks.
The study of monotone Boolean functions (MBFs) has a long history. We explore a connection between MBFs and ordinary differential equation (ODE) models of gene regulation, and, in particular, a problem of the realization of an MBF as a function describing the state transition graph of an ODE. We formulate a problem of joint realizability of finite collections of MBFs by establishing a connection between the parameterized dynamics of a class of ODEs and a collection of MBFs. We pose a question of what collections of MBFs can be realized by ODEs that belong to nested classes defined by increased algebraic complexity of their right-hand sides. As we progressively restrict the algebraic form of the ODE, we show by a combination of theory and explicit examples that the class of jointly realizable functions strictly decreases. Our results impact the study of regulatory network dynamics, as well as the classical area of MBFs. We conclude with a series of potential extensions and conjectures.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.