Software
Open Access

Dynamic simulation of regulatory networks using SQUAD

BMC Bioinformatics20078:462

https://doi.org/10.1186/1471-2105-8-462

©  Di Cara et al; licensee BioMed Central Ltd. 2007

Received: 22 August 2007

Accepted: 26 November 2007

Published: 26 November 2007

Abstract

Background

The ambition of most molecular biologists is the understanding of the intricate network of molecular interactions that control biological systems. As scientists uncover the components and the connectivity of these networks, it becomes possible to study their dynamical behavior as a whole and discover what is the specific role of each of their components. Since the behavior of a network is by no means intuitive, it becomes necessary to use computational models to understand its behavior and to be able to make predictions about it. Unfortunately, most current computational models describe small networks due to the scarcity of kinetic data available. To overcome this problem, we previously published a methodology to convert a signaling network into a dynamical system, even in the total absence of kinetic information. In this paper we present a software implementation of such methodology.

Results

We developed SQUAD, a software for the dynamic simulation of signaling networks using the standardized qualitative dynamical systems approach. SQUAD converts the network into a discrete dynamical system, and it uses a binary decision diagram algorithm to identify all the steady states of the system. Then, the software creates a continuous dynamical system and localizes its steady states which are located near the steady states of the discrete system. The software permits to make simulations on the continuous system, allowing for the modification of several parameters. Importantly, SQUAD includes a framework for perturbing networks in a manner similar to what is performed in experimental laboratory protocols, for example by activating receptors or knocking out molecular components. Using this software we have been able to successfully reproduce the behavior of the regulatory network implicated in T-helper cell differentiation.

Conclusion

The simulation of regulatory networks aims at predicting the behavior of a whole system when subject to stimuli, such as drugs, or determine the role of specific components within the network. The predictions can then be used to interpret and/or drive laboratory experiments. SQUAD provides a user-friendly graphical interface, accessible to both computational and experimental biologists for the fast qualitative simulation of large regulatory networks for which kinetic data is not necessarily available.

Background

Over the last ten years molecular biologists and biochemists have shifted their focus from the study of single molecular entities to the study of mechanisms that govern molecular regulation and behavior within the cellular environment. Thanks to these efforts and the advent of high-throughput experimental technologies, researchers in the past have been able to dissect part of the intricate network of molecular interactions existing inside cells. Computational modeling of these regulatory networks aims at further understanding how their components are controlled, thus allowing the prediction of a set of non-obvious conclusions that can be subsequently addressed experimentally.

While data on the connectivity among molecules is becoming increasingly available, the stoichiometry and kinetic data of the biochemical reactions behind most of these connections remain to be elucidated. This knowledge gap is currently one of the major problems encountered by modelers, particularly when addressing the study of non-metabolic networks, such as signaling cascades. To tackle this issue, we have previously developed a methodology named Standardized Qualitative Dynamical Systems [1], which is a hybrid modeling method combining Boolean (discrete) and continuous modeling methodologies. This approach enables the dynamic simulation of regulatory networks in the absence of kinetic data.

Boolean networks have been used as a convenient modeling tool due to their computational simplicity, giving rise to a large body of literature regarding their suitability for modeling diverse biological processes (see [2–6] for some examples). In Boolean models, nodes are represented as variables that can attain only two values: 0 or 1, which represent the minimal and maximal state of activation, respectively. These nodes are connected through directed relationships, which can be either positive (i.e. activatory) or negative (i.e. inhibitory). In most cases, the specification of the network connectivity is not sufficient to determine the response of a given node to all its possible inputs. Because of this, modelers have to specify a Boolean function for every node, incorporating as much information related to the biological system as possible. While Boolean models give appropriate qualitative descriptions of the real biological systems, models can be refined by incorporating nodes with more than two levels of activation. This is usually possible when enough experimental evidence is available, allowing to distinguish among different levels of activation [5]. In other cases, however, defining multiple activation levels helps to incorporate distinct functional levels into the nodes [6]. Also, Boolean models have been extended by introducing stochasticity in the updating order of the nodes [7].

The standardized qualitative dynamical systems modeling approach can also be seen as an extension of the Boolean methodology, because it creates a system of ordinary differential equations (ODEs) that have a similar overall form to the step functions of Boolean models. In this way, the nodes in the network can attain a continuous range of values while at the same time allowing a direct comparison with Boolean nodes, since both implementations have their lowest value at 0, and their highest value at 1. This approach permits the qualitative modeling of networks, but allowing for the possibility of incorporating quantitative information into the model via the fitting of parameters.

In order to facilitate the use of standardized qualitative dynamical systems, we developed the SQUAD modeling suite, which provides a graphical interface accessible to modelers and biologists to perform simulations of regulatory or signaling networks. This tool can speed up the process of modeling signaling networks, because it provides a rapid way to obtain the set of all stable steady states of a network as implied by its topology. Also, it provides a convenient graphical user interface to make dynamical simulations and evaluate the effect of altering parameters.

Simulations using SQUAD are divided in three main parts. First, we supply the program with a directed graph representing the topology of a network, which can be done in the form of simple text or sbml file formats (see ahead). The program converts the network into a discrete dynamical system, and uses Boolean algorithms to identify all its stable steady states. Second, the program converts the network into a continuous dynamical system, in the form of a set of ODEs, and uses the steady states found in the discrete model as a guide to localize the stable steady states in the continuous model. And third, SQUAD allows the user to perform dynamic simulations, which may include perturbations, to assess the behavior of the network and identify the roles of specific nodes within the network. We describe the use of SQUAD, exemplifying it with simulations of the T-helper cell signaling pathway, which has been amply studied using different formalisms [1, 8, 9].

Implementation

SQUAD is written in Java version 1.6. The network topology is loaded using any of three possible formats: net, mml and sbml (see Additional file 1 for a description). Sbml files are parsed using the jigcell SBML parser [10]. In order to represent the graphs both in memory and graphically, we use an extension to the JUNG library [11] built purposely to integrate parameters required for the dynamic simulations. The steady states of the loaded graphs are computed using a Reduced Order Binary Decision Diagram algorithm, described in detail in [8]. This algorithm is written in C++ and is integrated to the package through the Java Native Interface (JNI). The ordinary differential equations used for the dynamic simulations are implemented using the Open Source Physics framework (OSP) [12], using an adapted version of the Runge-Kutta4 solver to do the numerical computation. Furthermore, the OSP library is also used to display the activity using dynamic plots. The results of the simulations are stored in matrices using the dcolt package [13], which allows mapping of the matrices to a file system in order to reduce the memory expenditure. Finally, the user interface is built using java swing components, and the synthetica library is used to provide a consistent aspect on multiple platforms.

Results

Definition of the network topology

The first step towards modeling signaling networks is to define the components of the network and their connectivity. We symbolize the components of a network through nodes, represented as variables whose values reflect a state of activity. Nodes do not necessarily represent single molecules, but rather functional entities such as molecular complexes. In the T-helper network for example (Figure 1, upper left) the node describing the interferon-γ receptor (IFNg-R) represents a complex of multiple subunits that when active elicits the activation of the nodes downstream. The connectivity among nodes is expressed in terms of "activations" or "inhibitions". Once the topology of the network is established, it can be loaded into SQUAD to perform analyses and simulations.
Figure 1

Identification of steady states using SQUAD. Graphical description of the identification of steady states using SQUAD. The model for the T-helper cell network (upper left figure) is loaded into SQUAD (upper center figure) using a CellDesigner sbml file. SQUAD displays the steady states identified in the network (upper right figures) through a scrollable list containing the values of the active nodes for each configuration. In addition the steady states can be visualized directly on the network topology (lower figures). For the T-helper network three steady states exist. Based on the molecular fingerprint, each state can be mapped to an existing biological state: State1 with all the nodes inactive corresponds to the Th0 cells. State2 with active IFNγ corresponds to the Th1 cells. State3 with active IL-4 corresponds to the Th2 state.

SQUAD accepts three types of input formats: net, mml and sbml files. The net format is a simple text file, and the mml format is a XML file; both were developed specifically for SQUAD (see Additional file 1 for a description of the formats). Since defining a network topology for large networks in text format can be difficult and error-prone, we have included the possibility of using CellDesigner [14, 15] generated files as input. CellDesigner is a free, widely used graphical tool that allows the easy construction and edition of diagrams of metabolic and regulatory networks. CellDesigner has an implementation of the SBML (Systems Biology Markup Language) format [16], used by a large number of modeling tools. Whenever CellDesigner files are used as input, SQUAD retains the spatial layout of the nodes providing a more intuitive interpretation of the simulation results (use Additional file 2 as an example). The distribution of SQUAD includes a folder containing the T-helper network sample files in the three aforementioned formats.

Identification of network steady states using SQUAD

Biological systems are governed and regulated by intricate networks, most of the time containing feedback loops, whose activity is influenced by environmental stimuli. An illustrative example is the process of differentiation of precursor T-helper cells into effector Th1 or Th2 cells, in which a complex network controls the transition from a cell type to another according to the cytokines to which the precursor cells are exposed [17]. Dynamical systems may contain stable steady states, defined as specific activation states of the network, which do not change over time and are resistant to small perturbations. To find these stable steady states, it is necessary to translate the network topology into a dynamical system. We have previously published a methodology to automate this process [1]; hence, users of SQUAD only have to provide a network topology. The static representation of a network can be converted into a discrete dynamical system using the Equation 1 (described in [1]).
x i ( t + 1 ) = { ( x 1 a ( t ) ∨ x 2 a ( t ) … ∨ x n a ( t ) ) ∧ ¬ ( x 1 i ( t ) ∨ x 2 i ( t ) … ∨ x m i ( t ) ) a x 1 a ( t ) ∨ x 2 a ( t ) … ∨ x n a ( t ) b ¬ ( x 1 i ( t ) ∨ x 2 i ( t ) … ∨ x m i ( t ) ) c ∨ , ∧ , and  ¬  are the logical operators OR, AND, and NOT x i ∈ { 0 , 1 } { x n a }  is the set of activators of  x i { x n i }  is the set of inhibitors of  x i a is used if  x i  has activators and inhibitors b is used if  x i  has only activators c is used if  x i  has only inhibitors MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaqbaeqabGqaaaaaaeaacqWG4baEdaWgaaWcbaGaemyAaKgabeaakiabcIcaOiabdsha0jabgUcaRiabigdaXiabcMcaPiabg2da9maaceqabaqbaeqabmGaaaqaaiabcIcaOiabdIha4naaDaaaleaacqaIXaqmaeaacqWGHbqyaaGccqGGOaakcqWG0baDcqGGPaqkcqGHOiI2cqWG4baEdaqhaaWcbaGaeGOmaidabaGaemyyaegaaOGaeiikaGIaemiDaqNaeiykaKIaeSOjGSKaeyikIOTaemiEaG3aa0baaSqaaiabd6gaUbqaaiabdggaHbaakiabcIcaOiabdsha0jabcMcaPiabcMcaPiabgEIizlabgYkaylabcIcaOiabdIha4naaDaaaleaacqaIXaqmaeaacqWGPbqAaaGccqGGOaakcqWG0baDcqGGPaqkcqGHOiI2cqWG4baEdaqhaaWcbaGaeGOmaidabaGaemyAaKgaaOGaeiikaGIaemiDaqNaeiykaKIaeSOjGSKaeyikIOTaemiEaG3aa0baaSqaaiabd2gaTbqaaiabdMgaPbaakiabcIcaOiabdsha0jabcMcaPiabcMcaPaqaaGqadiab=fgaHbqaaiabdIha4naaDaaaleaacqaIXaqmaeaacqWGHbqyaaGccqGGOaakcqWG0baDcqGGPaqkcqGHOiI2cqWG4baEdaqhaaWcbaGaeGOmaidabaGaemyyaegaaOGaeiikaGIaemiDaqNaeiykaKIaeSOjGSKaeyikIOTaemiEaG3aa0baaSqaaiabd6gaUbqaaiabdggaHbaakiabcIcaOiabdsha0jabcMcaPaqaaiab=jgaIbqaaiabgYkaylabcIcaOiabdIha4naaDaaaleaacqaIXaqmaeaacqWGPbqAaaGccqGGOaakcqWG0baDcqGGPaqkcqGHOiI2cqWG4baEdaqhaaWcbaGaeGOmaidabaGaemyAaKgaaOGaeiikaGIaemiDaqNaeiykaKIaeSOjGSKaeyikIOTaemiEaG3aa0baaSqaaiabd2gaTbqaaiabdMgaPbaakiabcIcaOiabdsha0jabcMcaPiabcMcaPaqaaiab=ngaJbaaaiaawUhaaaqaaiabgIIiAlabcYcaSiabgEIizlabcYcaSiabbggaHjabb6gaUjabbsgaKjabbccaGiabgYkaylabbccaGiabbggaHjabbkhaYjabbwgaLjabbccaGiabbsha0jabbIgaOjabbwgaLjabbccaGiabbYgaSjabb+gaVjabbEgaNjabbMgaPjabbogaJjabbggaHjabbYgaSjabbccaGiabb+gaVjabbchaWjabbwgaLjabbkhaYjabbggaHjabbsha0jabb+gaVjabbkhaYjabbohaZjabbccaGiabb+eapjabbkfasjabbYcaSiabbccaGiabbgeabjabb6eaojabbseaejabbYcaSiabbccaGiabbggaHjabb6gaUjabbsgaKjabbccaGiabb6eaojabb+eapjabbsfaubqaaiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeyicI4Saei4EaSNaeGimaaJaeiilaWIaeGymaeJaeiyFa0habaGaei4EaSNaemiEaG3aa0baaSqaaiabd6gaUbqaaiabdggaHbaakiabc2ha9jabbccaGiabbMgaPjabbohaZjabbccaGiabbsha0jabbIgaOjabbwgaLjabbccaGiabbohaZjabbwgaLjabbsha0jabbccaGiabb+gaVjabbAgaMjabbccaGiabbggaHjabbogaJjabbsha0jabbMgaPjabbAha2jabbggaHjabbsha0jabb+gaVjabbkhaYjabbohaZjabbccaGiabb+gaVjabbAgaMjabbccaGiabdIha4naaBaaaleaacqWGPbqAaeqaaaGcbaGaei4EaSNaemiEaG3aa0baaSqaaiabd6gaUbqaaiabdMgaPbaakiabc2ha9jabbccaGiabbMgaPjabbohaZjabbccaGiabbsha0jabbIgaOjabbwgaLjabbccaGiabbohaZjabbwgaLjabbsha0jabbccaGiabb+gaVjabbAgaMjabbccaGiabbMgaPjabb6gaUjabbIgaOjabbMgaPjabbkgaIjabbMgaPjabbsha0jabb+gaVjabbkhaYjabbohaZjabbccaGiabb+gaVjabbAgaMjabbccaGiabdIha4naaBaaaleaacqWGPbqAaeqaaaGcbaGae8xyaeMae8hiaaIaeeyAaKMaee4CamNaeeiiaaIaeeyDauNaee4CamNaeeyzauMaeeizaqMaeeiiaaIaeeyAaKMaeeOzayMaeeiiaaIaemiEaG3aaSbaaSqaaiabdMgaPbqabaGccqqGGaaicqqGObaAcqqGHbqycqqGZbWCcqqGGaaicqqGHbqycqqGJbWycqqG0baDcqqGPbqAcqqG2bGDcqqGHbqycqqG0baDcqqGVbWBcqqGYbGCcqqGZbWCcqqGGaaicqqGHbqycqqGUbGBcqqGKbazcqqGGaaicqqGPbqAcqqGUbGBcqqGObaAcqqGPbqAcqqGIbGycqqGPbqAcqqG0baDcqqGVbWBcqqGYbGCcqqGZbWCaeaacqWFIbGycqWFGaaicqqGPbqAcqqGZbWCcqqGGaaicqqG1bqDcqqGZbWCcqqGLbqzcqqGKbazcqqGGaaicqqGPbqAcqqGMbGzcqqGGaaicqWG4baEdaWgaaWcbaGaemyAaKgabeaakiabbccaGiabbIgaOjabbggaHjabbohaZjabbccaGiabb+gaVjabb6gaUjabbYgaSjabbMha5jabbccaGiabbggaHjabbogaJjabbsha0jabbMgaPjabbAha2jabbggaHjabbsha0jabb+gaVjabbkhaYjabbohaZbqaaiab=ngaJjab=bcaGiabbMgaPjabbohaZjabbccaGiabbwha1jabbohaZjabbwgaLjabbsgaKjabbccaGiabbMgaPjabbAgaMjabbccaGiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeeiiaaIaeeiAaGMaeeyyaeMaee4CamNaeeiiaaIaee4Ba8MaeeOBa4MaeeiBaWMaeeyEaKNaeeiiaaIaeeyAaKMaeeOBa4MaeeiAaGMaeeyAaKMaeeOyaiMaeeyAaKMaeeiDaqNaee4Ba8MaeeOCaiNaee4Camhaaaaa@E4CE@
(1)

Once the network has been translated into a discrete dynamical system, it is possible to locate all its stable steady states using the Generalized Logical Analysis (GLA) [18], which is based on the analysis of the functionality of all the feedback loops that constitute the network. GLA is a well-established methodology to analyze the behavior of regulatory networks, even when they contain nodes with more than two levels of activation. However, the methodology has proved to scale badly for large networks. To address this issue, we implemented a Reduced Order Binary Decision Diagram (ROBDD) algorithm [8] in SQUAD. In contrast to GLA, the ROBDD algorithm works for networks containing only binary nodes.

ROBDD is a memory efficient data structure for representing the exponential state-space of logic functions, widely used in the field of electronic design automation and model checking. Using ROBDDs we can compute a set of subsequent network states in such a way that the state-space traversal can be performed very efficiently. Our implementation optimizes the use of ROBDDs by finding steady states without testing all the possible states of the network, allowing analysis of large regulatory networks. Using this algorithm we are able to identify the steady states of complex networks (>50 nodes) on a desktop computer in a matter of seconds (benchmarked on a Pentium4 2.1 GHz CPU). To support our claim, we provide a network of 111 nodes (Additional file 3) that can be tested for speed by the users. Another advantage of using the ROBDD algorithm is the identification of cyclic attractors, i.e. oscillating states. These states occur when the system does not reach a steady state, but rather a cycling pattern. We used SQUAD to identify the steady states of the T-helper cell network (Figure 1) either through GLA [1] or ROBDD. In both cases SQUAD identifies 3 stable steady states visible through the steady state selector panel (Figure 1, upper rightmost image), or on the graphical network layout (Figure 1, lower images). As previously reported [1], the steady states identified in the T-helper network can be mapped to a specific biological states of T-helper cells, namely the Th0, Th1 and Th2 cell types.

Using SQUAD for studying the dynamic behavior of a network

SQUAD allows the identification of the stable steady states present in the network, but it does not provide information on the events that lead to these states. In other words, it finds the attractors but it does not give any information on the basins of attraction.

SQUAD automatically converts the static network into a continuous dynamical system (as explained in [1]) using Equation 2.
d x i d t = − e 0.5 h + e − h ( ω i ) ( 1 − e 0.5 h ) ( 1 + e − h ( ω i − 0.5 ) ) − γ i x i ω i = { ( 1 − ∑ α n ∑ α n ) ( ∑ α n x n a 1 + ∑ α n x n a ) ( 1 − ( 1 + ∑ β m ∑ β m ) ( ∑ β m x m i 1 + ∑ β m x m i ) ) a ( 1 − ∑ α n ∑ α n ) ( ∑ α n x n a 1 + ∑ α n x n a ) b ( 1 − ( 1 + ∑ β m ∑ β m ) ( ∑ β m x m i 1 + ∑ β m x m i ) ) c 0 ≤ x i ≤ 1 0 ≤ ω i ≤ 1 h , α n , β m > 0 γ i ≥ 1 { x n a }  is the set of activators of  x i { x n i }  is the set of inhibitors of  x i a is used if  x i  has activators and inhibitors b is used if  x i  has only activators c is used if  x i  has only inhibitors MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaqbaeqabSqaaaaaaeaajuaGdaWcaaqaaiabdsgaKjabdIha4naaBaaabaGaemyAaKgabeaaaeaacqWGKbazcqWG0baDaaGccqGH9aqpjuaGdaWcaaqaaiabgkHiTiabdwgaLnaaCaaabeqaaiabicdaWiabc6caUiabiwda1iabbIgaObaacqGHRaWkcqWGLbqzdaahaaqabeaacqGHsislcqWGObaAcqGGOaakiiGacqWFjpWDdaWgaaqaaiabdMgaPbqabaGaeiykaKcaaaqaaiabcIcaOiabigdaXiabgkHiTiabdwgaLnaaCaaabeqaaiabicdaWiabc6caUiabiwda1iabbIgaObaacqGGPaqkcqGGOaakcqaIXaqmcqGHRaWkcqWGLbqzdaahaaqabeaacqGHsislcqWGObaAcqGGOaakcqWFjpWDdaWgaaqaaiabdMgaPbqabaGaeyOeI0IaeGimaaJaeiOla4IaeGynauJaeiykaKcaaiabcMcaPaaakiabgkHiTiab=n7aNnaaBaaaleaacqWGPbqAaeqaaOGaemiEaG3aaSbaaSqaaiabdMgaPbqabaaakeaacqWFjpWDdaWgaaWcbaGaemyAaKgabeaakiabg2da9maaceqabaqbaeqabmGaaaqaaiabcIcaOKqbaoaalaaabaGaeGymaeJaeyOeI0YaaabqaeaacqWFXoqydaWgaaqaaiabd6gaUbqabaaabeqabiabggHiLdaabaWaaabqaeaacqWFXoqydaWgaaqaaiabd6gaUbqabaaabeqabiabggHiLdaaaOGaeiykaKIaeiikaGscfa4aaSaaaeaadaaeabqaaiab=f7aHnaaBaaabaGaemOBa4gabeaaaeqabeGaeyyeIuoacqWG4baEdaqhaaqaaiabd6gaUbqaaiabdggaHbaaaeaacqaIXaqmcqGHRaWkdaaeabqaaiab=f7aHnaaBaaabaGaemOBa4gabeaacqWG4baEdaqhaaqaaiabd6gaUbqaaiabdggaHbaaaeqabeGaeyyeIuoaaaGccqGGPaqkcqGGOaakcqaIXaqmcqGHsislcqGGOaakjuaGdaWcaaqaaiabigdaXiabgUcaRmaaqaeabaGae8NSdi2aaSbaaeaacqWGTbqBaeqaaaqabeqacqGHris5aaqaamaaqaeabaGae8NSdi2aaSbaaeaacqWGTbqBaeqaaaqabeqacqGHris5aaaakiabcMcaPiabcIcaOKqbaoaalaaabaWaaabqaeaacqWFYoGydaWgaaqaaiabd2gaTbqabaGaemiEaG3aa0baaeaacqWGTbqBaeaacqWGPbqAaaaabeqabiabggHiLdaabaGaeGymaeJaey4kaSYaaabqaeaacqWFYoGydaWgaaqaaiabd2gaTbqabaGaemiEaG3aa0baaeaacqWGTbqBaeaacqWGPbqAaaaabeqabiabggHiLdaaaOGaeiykaKIaeiykaKcabaacbmGae4xyaegabaGaeiikaGscfa4aaSaaaeaacqaIXaqmcqGHsisldaaeabqaaiab=f7aHnaaBaaabaGaemOBa4gabeaaaeqabeGaeyyeIuoaaeaadaaeabqaaiab=f7aHnaaBaaabaGaemOBa4gabeaaaeqabeGaeyyeIuoaaaGccqGGPaqkcqGGOaakjuaGdaWcaaqaamaaqaeabaGae8xSde2aaSbaaeaacqWGUbGBaeqaaaqabeqacqGHris5aiabdIha4naaDaaabaGaemOBa4gabaGaemyyaegaaaqaaiabigdaXiabgUcaRmaaqaeabaGae8xSde2aaSbaaeaacqWGUbGBaeqaaiabdIha4naaDaaabaGaemOBa4gabaGaemyyaegaaaqabeqacqGHris5aaaakiabcMcaPaqaaiab+jgaIbqaaiabcIcaOiabigdaXiabgkHiTiabcIcaOKqbaoaalaaabaGaeGymaeJaey4kaSYaaabqaeaacqWFYoGydaWgaaqaaiabd2gaTbqabaaabeqabiabggHiLdaabaWaaabqaeaacqWFYoGydaWgaaqaaiabd2gaTbqabaaabeqabiabggHiLdaaaOGaeiykaKIaeiikaGscfa4aaSaaaeaadaaeabqaaiab=j7aInaaBaaabaGaemyBa0gabeaacqWG4baEdaqhaaqaaiabd2gaTbqaaiabdMgaPbaaaeqabeGaeyyeIuoaaeaacqaIXaqmcqGHRaWkdaaeabqaaiab=j7aInaaBaaabaGaemyBa0gabeaacqWG4baEdaqhaaqaaiabd2gaTbqaaiabdMgaPbaaaeqabeGaeyyeIuoaaaGccqGGPaqkcqGGPaqkaeaacqGFJbWyaaaacaGL7baaaeaacqaIWaamcqGHKjYOcqWG4baEdaWgaaWcbaGaemyAaKgabeaakiabgsMiJkabigdaXaqaaiabicdaWiabgsMiJkab=L8a3naaBaaaleaacqWGPbqAaeqaaOGaeyizImQaeGymaedabaGaemiAaGMaeiilaWIae8xSde2aaSbaaSqaaiabd6gaUbqabaGccqGGSaalcqWFYoGydaWgaaWcbaGaemyBa0gabeaakiabg6da+iabicdaWaqaaiab=n7aNnaaBaaaleaacqWGPbqAaeqaaOGaeyyzImRaeGymaedabaGaei4EaSNaemiEaG3aa0baaSqaaiabd6gaUbqaaiabdggaHbaakiabc2ha9jabbccaGiabbMgaPjabbohaZjabbccaGiabbsha0jabbIgaOjabbwgaLjabbccaGiabbohaZjabbwgaLjabbsha0jabbccaGiabb+gaVjabbAgaMjabbccaGiabbggaHjabbogaJjabbsha0jabbMgaPjabbAha2jabbggaHjabbsha0jabb+gaVjabbkhaYjabbohaZjabbccaGiabb+gaVjabbAgaMjabbccaGiabdIha4naaBaaaleaacqWGPbqAaeqaaaGcbaGaei4EaSNaemiEaG3aa0baaSqaaiabd6gaUbqaaiabdMgaPbaakiabc2ha9jabbccaGiabbMgaPjabbohaZjabbccaGiabbsha0jabbIgaOjabbwgaLjabbccaGiabbohaZjabbwgaLjabbsha0jabbccaGiabb+gaVjabbAgaMjabbccaGiabbMgaPjabb6gaUjabbIgaOjabbMgaPjabbkgaIjabbMgaPjabbsha0jabb+gaVjabbkhaYjabbohaZjabbccaGiabb+gaVjabbAgaMjabbccaGiabdIha4naaBaaaleaacqWGPbqAaeqaaaGcbaGae4xyaeMae4hiaaIaeeyAaKMaee4CamNaeeiiaaIaeeyDauNaee4CamNaeeyzauMaeeizaqMaeeiiaaIaeeyAaKMaeeOzayMaeeiiaaIaemiEaG3aaSbaaSqaaiabdMgaPbqabaGccqqGGaaicqqGObaAcqqGHbqycqqGZbWCcqqGGaaicqqGHbqycqqGJbWycqqG0baDcqqGPbqAcqqG2bGDcqqGHbqycqqG0baDcqqGVbWBcqqGYbGCcqqGZbWCcqqGGaaicqqGHbqycqqGUbGBcqqGKbazcqqGGaaicqqGPbqAcqqGUbGBcqqGObaAcqqGPbqAcqqGIbGycqqGPbqAcqqG0baDcqqGVbWBcqqGYbGCcqqGZbWCaeaacqGFIbGycqGFGaaicqqGPbqAcqqGZbWCcqqGGaaicqqG1bqDcqqGZbWCcqqGLbqzcqqGKbazcqqGGaaicqqGPbqAcqqGMbGzcqqGGaaicqWG4baEdaWgaaWcbaGaemyAaKgabeaakiabbccaGiabbIgaOjabbggaHjabbohaZjabbccaGiabb+gaVjabb6gaUjabbYgaSjabbMha5jabbccaGiabbggaHjabbogaJjabbsha0jabbMgaPjabbAha2jabbggaHjabbsha0jabb+gaVjabbkhaYjabbohaZbqaaiab+ngaJjab+bcaGiabbMgaPjabbohaZjabbccaGiabbwha1jabbohaZjabbwgaLjabbsgaKjabbccaGiabbMgaPjabbAgaMjabbccaGiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeeiiaaIaeeiAaGMaeeyyaeMaee4CamNaeeiiaaIaee4Ba8MaeeOBa4MaeeiBaWMaeeyEaKNaeeiiaaIaeeyAaKMaeeOBa4MaeeiAaGMaeeyAaKMaeeOyaiMaeeyAaKMaeeiDaqNaee4Ba8MaeeOCaiNaee4Camhaaaaa@1C1E@
(2)

Within this methodology, variables representing the activity of nodes are normalized, thus providing continuous levels of activation between 0 and 1 where, as in the discrete model, 1 represents the full-activation of a node.

In order to perform simulations, SQUAD solves numerically the continuous dynamical system starting from a given initial state, and a set of values for all parameters. By default, SQUAD sets all values of α's (weight of activations), β's (weight of inhibitions) to 1, and a value of 10 to h (the gain of the sigmoid). Users may change these values in the tables presenting the node and edge configurations. As for the initial states, the software uses the set of stable steady states found in the discrete implementation of the network. Here again, the user is able to specify any initial state that best matches the biological question addressed. In the case of the T-helper network for example, we can use the Th0 steady state, where all the nodes are set to 0, as a starting point for the dynamic simulations.

SQUAD provides a number of graphical utilities to perform simulations. In the steady state selector panel it is possible to choose the starting state from the list of stable steady states automatically found by the system. The selected state can then be further modified to simulate alternative initial states, allowing for the inclusion of perturbations. The results of the simulations are shown by a plot of the activity of each node against time (Figure 2). Importantly, since the equations used for the dynamic simulation are not fitted with experimentally determined kinetic values, the time is expressed in arbitrary units.
Figure 2

Dynamic simulation of the T-helper regulatory network, in the presence of IL-4. The plot provided by SQUAD displays the behavior of each component of the network according to time. The values range between 0 (inactive) and 1 (active). Time 0 indicates the time of addition of IL-4 to the network in the Th0 state. In addition to the plot display, SQUAD provides a dynamic network display (top panel) in which the nodes are colored in real-time according to the activation level from white (completely inactive) to black (completely active). The three top images are snapshots of the network at different time points. At Time 0 the network is in the Th0 and and a pulse of IL-4 is added to the system. The pulse originates a transitory state of activation (Time 2.6 is shown), which eventually leads the system to steady state representing the Th2 state (Time 6 and onwards). Time is expressed in arbitrary units.

Simulations in SQUAD can be performed in two modes. The complete run option sets the dynamic simulation to stop either at a pre-defined time point, or when a steady state is reached. By contrast, in the progressive simulation mode the user is able to control the speed of the simulation and stop it at will. In addition to the plot of time-series, SQUAD also displays the activation status of all nodes. This is particularly useful to make a more intuitive display of how some signals propagate through the network. To exemplify the use of these graphical tools, Figure 2 presents a simulation of the behavior of the Th0 steady state in which the IL-4 node is activated, thus mimicking the addition of IL-4 ligand to the network. We observe that the network moves to the Th2 steady state in response to the IL-4 ligand.

The algorithm behind SQUAD has already been shown to correctly describe the qualitative behavior of a large regulatory network [1]. Different networks, however, might require special manipulations before being analyzed by SQUAD. This is the case whenever there are nodes implementing the AND logical function. Equation 1 indicates that a node integrates the total input by means of OR functions, apparently hindering the use of AND relationships between input nodes. This seeming problem can be solved by the introduction of an intermediary node. Suppose the user needs to include a node X that becomes active only when nodes A and B are both active. In this case, it is necessary to decompose one of the direct activations, say from A to X, into a pair of inhibitions via an extra node, C, created ad hoc. The final topology would then become A¬C¬X ← B. By applying Equation 1 we can see that X = B ∧ ¬ C, but since C = ¬ A then X = A ∧ B, which is the desired AND relationship between the A and B nodes over X. This solution for including AND gates increases the number of nodes in the network, and thus it might introduce some extra states in the attractors. Hence, the user has to be careful to eliminate from the final list of attractor the states of these intermediate nodes. Nevertheless, we are currently working on the explicit incorporation of AND gates into our methodology.

Using laboratory protocols for modeling

As discussed in the previous section, dynamic simulations are extremely useful for assessing how a network behaves in response to different stimuli. In the work described so far we have addressed the influence of stimuli such as IL-4 on the initial steady state. Biological experimental protocols however often rely on perturbations using multiple stimuli, at different times and for varying durations. To map the computational simulations to such biological experiments we have included in SQUAD a framework for performing dynamic perturbations.

The perturbations to be performed are listed within a protocol file written in a dedicated XML format (see Additional file 4, with extension prt). The file describes a set of initial network states and a set of perturbations. Each perturbation corresponds to a separate experiment containing an initial state and a set of actions specifying the node(s) to perturb, the perturbation value(s) as well as the duration and timing of the perturbations. Different types of actions can be specified. For example the singlepulse action modifies the node at a single time point, while rangepulse maintains the perturbation for a determined time period. The protocol file can be created within SQUAD using a wizard tool, which ensures that the protocol file has a valid format (Figure 3). Using these protocols it is possible to reproduce existing biological experiments computationally, or to test new experimental designs. Furthermore, having a file format to specify dynamic simulations allows for the storing, exchanging and comparisons of protocols.
Figure 3

Screenshots of the perturbation protocol designer tool. This tool is used to create and edit perturbation protocols. The protocol contains two perturbations. For each perturbation an initial state is described. Each perturbation has one ore more "action" elements, which specify the types of perturbations to be performed. More complex protocols can include other types of actions such as perturbations over a time range or node knockouts. (A) Tree view: contains wizard buttons to add, edit and delete parts of the protocol. (B) Text view: provides a textual representation of the protocol file. Once generated, the protocol file can be saved and re-used.

We have used the perturbation framework on the T-helper cell network to assess the effects of IL-4 and IFN-γ (Figure 4 and Additional file 4). As shown in the previous section, the addition of IL-4 to the Th0 state moves the network towards the Th2 steady state (Figure 4A). Similarly, using the perturbation protocols we tested the effect of adding an IFN-γ pulse on the Th2 steady state (Figure 4B). Under these circumstances the Th2 state is temporarily perturbed, but returns to the Th2 state, consistent with experimental data showing the stability of Th2 cells [19].
Figure 4

Perturbations of the Th0 state with IL-4 and IFN- γ. Each curve represents the activity of a node in function of time. (A) Effect of IL-4 (red upward triangle) on the Th0 state (B) effect of IL-4 (red upward triangle) on the Th0 state and effect of IFNγ (yellow upward triangle) on the IL-4 induced Th2 state.

Conclusion

Here, we demonstrate how the use of SQUAD helps to simulate the behavior of regulatory networks, modeled with the standardized qualitative dynamical systems methodology. This method can be used to study signaling or regulatory networks where there is little or no kinetic data available, but there is a good knowledge of the network topology. While there are no restrictions in the kind of biological phenomena that can be modeled with our methodology, it seems to be particularly suitable for differentiation processes, where multiple stable steady states can be interpreted as different cell types, as we have shown for the Th model [1]. SQUAD automatically locates the alternative stable steady states of the system, and the user can gain further knowledge of the model by using the several simulation tools provided, specially the ability to perform perturbations, mutations, and changes in the parameters to observe the effect on the nature and number of attractors.

The methodology implemented by SQUAD is able to find the attractors of the network under study. This information is relevant because it permits the user to know which are the alternative asymptotic behaviors that can be reached by the system. In its current implementation SQUAD does not provide information regarding the basins of attraction. That is, the software does not provide the user with a list of all the possible states that can reach a given steady state. However, we have introduced the possibility to export the model to a file in GNU Octave format [20], which can be modified to accomplish this job. The user has to be aware that the dynamical system exported by SQUAD is the one obtained by applying Equation 2, which is a deterministic set of ordinary differential equations.

The algorithms behind SQUAD have been thoroughly tested for the location of fixed-point attractors. Nevertheless, the methodology used by SQUAD can also identify cyclic attractors (see [8] for details). If a cyclic attractor is found, SQUAD displays one of its transitory states which, if used as an initial state in the dynamic simulations, will resume the oscillatory behavior of the system. The software, however, does not provide an automated way to visualize all possible cycles in the network when it is modeled as a discrete dynamical state, as GINSim does [3].

With SQUAD we have extended the original methodology published in [1] to allow the analysis of large regulatory networks (>50 nodes) by implementing a Reduced Order Binary Decision Diagram algorithm. In addition we have streamlined the whole modeling process by developing SQUAD with an intuitive interface that provides a dynamic visualization of the network. Many modeling software packages rely on their own input format. While this is the case for SQUAD, the program is also able to read CellDesigner sbml files [15], a file format widely used in the modeling community providing a seamless integration with several network drawing software and model repositories [21].

SQUAD is aimed at helping the scientific community to understand the global qualitative dynamical behavior of signaling networks. First, people may use the software to gain insight on the dynamical implications of a given network topology. It is often the case that there is enough information about the topology of a particular network, but there is no information on the biochemical reactions behind it. In this case, SQUAD can be of help by adding a dynamical dimension to such topologies, by creating dynamical systems based only on the network architecture. Experimental biologists may be specially benefited by testing different topologies and deciding which one offers the most accurate dynamical description to their phenomena of interest. Users with a moderate knowledge in modeling can benefit of the user-friendly interface that allows to modify the initial states, strength of interactions, decay rates, perturbation protocols and plotting capabilities of SQUAD. All these capabilities will help the user in predicting the dynamic behavior of a network in response to multiple stimuli or mutations, being knockouts, over expression, or a mixture thereof, as well as pinpointing the roles of specific components within a network.

There are other software packages that are used to generate qualitative models of regulatory networks, notably GINSim [3, 22], Genetic Network Analyzer (GNA) [23] and CellNetAnalyzer (CNA) [24]. These modeling suites simulate networks implemented as dynamical systems, using either discrete (GINSim, CNA) or continuous systems (GNA). These packages have been shown to qualitatively reproduce the activation patterns of experimentally validated regulatory networks. For example, GNA has been used to analyze the network underlying the initiation of sporulation in Bacillus subtilis [25], GINSim to study the formation of discrete expression region of gap-genes Drosophila [26], and CellNetAnalyzer in T-Cell activation [27]. SQUAD complements these approaches by allowing the qualitative modeling using a set of non-linear ordinary differential equations. With the increase of published signaling networks, it will be possible in the future to realize a benchmark among these software packages to compare their strengths and weaknesses. For doing that, however, it would be very useful to develop a common file format. For the time being, SQUAD and CellNetAnalyzer have the possibility to read sbml files, which is becoming a widely used standard in the modeling community.

SQUAD has been implemented as part of the ENFIN project [28, 29] committed to provide an integration of computational approaches in systems biology and the development of tools for harnessing biological system-level data. SQUAD constitutes an easy-to-use regulatory network modeling tool, accessible to both computational and experimental biologists.

Availability and requirements

SQUAD can be downloaded from [30]. The website contains a quick-start guide and a detailed tutorial. Also, a copy of the SQUAD executables is provided in Additional file 5.

Operating system(s): Windows and Linux (32-bit versions).

Requirements: Java 1.6 or higher.

Programming language: Java and C++ for the ROBDD algorithm.

Restrictions of use by non-academic users: None.

Declarations

Acknowledgements

This work was supported in part by ENFIN, a Network of Excellence funded by the FP6 Programme of the European Commission, under the thematic area "Life sciences, genomics and biotechnology for health", contract number LSHG-CT-2005-518254. We would like to thank Christophe Cleva for his insights in code optimization and the development of the dcolt package; Mark Ibberson for reviewing the manuscript; Massimo De Francesco and Merck Serono for providing the necessary infrastructure; and two anonymous reviewers for their valuable comments on the manuscript.

Authors’ Affiliations

(1)
Merck Serono
(2)
EPFL
(3)
Swiss Institute of Bioinformatics, Vital-IT Group, Quartier Sorge – Batiment Genopode
(4)
Instituto de Investigaciones Biomédicas, Universidad Nacional Autónoma de México, Ciudad Universitaria

References

  1. Mendoza L, Xenarios I: A method for the generation of standardized qualitative dynamical systems of regulatory networks. Theor Biol Med Model. 2006, 3: 13-10.1186/1742-4682-3-13.PubMed CentralView ArticlePubMedGoogle Scholar
  2. Kauffman S: A proposal for using the ensemble approach to understand genetic regulatory networks. J Theor Biol. 2004, 230: 581-590. 10.1016/j.jtbi.2003.12.017.View ArticlePubMedGoogle Scholar
  3. Faure A, Naldi A, Chaouiya C, Thieffry D: Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle. Bioinformatics. 2006, 22: e124-e131. 10.1093/bioinformatics/btl210.View ArticlePubMedGoogle Scholar
  4. Albert R, Othmer HG: The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster. J Theor Biol. 2003, 223: 1-18. 10.1016/S0022-5193(03)00035-3.View ArticlePubMedGoogle Scholar
  5. Espinosa-Soto C, Padilla-Longoria P, Alvarez-Buylla ER: A gene regulatory network model for cell-fate determination during Arabidopsis thaliana flower development that is robust and recovers experimental gene expression profiles. Plant Cell. 2004, 16: 2923-2939. 10.1105/tpc.104.021725.PubMed CentralView ArticlePubMedGoogle Scholar
  6. Sánchez L, Thieffry D: A logical analysis of the Drosophila gap-gene system. J Theor Biol. 2001, 211: 115-141. 10.1006/jtbi.2001.2335.View ArticlePubMedGoogle Scholar
  7. Chaves M, Albert R, Sontag ED: Robustness and fragility of Boolean models for genetic regulatory networks. J Theor Biol. 2005, 235: 431-449. 10.1016/j.jtbi.2005.01.023.View ArticlePubMedGoogle Scholar
  8. Garg A, Xenarios I, Mendoza L, DeMicheli G: Efficient methods for dynamic analysis of genetic networks and in silico gene perturbation experiments. Lect Notes Comput Sci. 2007, 4453: 62-76.View ArticleGoogle Scholar
  9. Remy E, Ruet P, Mendoza L, Thieffry D, Chaouiya C: From logical regulatory graphs to standard petri nets: Dynamical roles and functionality of feedback circuits. Lect Notes Comput Sci. 2006, 4230: 56-72.View ArticleGoogle Scholar
  10. Jigcell. [http://jigcell.biol.vt.edu]
  11. Java Universal Network/Graph Framework. [http://jung.sourceforge.net]
  12. Open Source Physics. [http://www.opensourcephysics.org]
  13. Dcolt project. [http://sourceforge.net/projects/tlabs]
  14. Funahashi A, Tanimura N, Morohashi M, Kitano H: CellDesigner: a process diagram editor for gene-regulatory and biochemical networks. Biosilico. 2003, 1: 159-162. 10.1016/S1478-5382(03)02370-9.View ArticleGoogle Scholar
  15. CellDesigner. [http://www.celldesigner.org]
  16. Systems Biology Markup Language. [http://sbml.org]
  17. Singh VK, Mehrotra S, Agarwal SS: The paradigm of Th1 and Th2 cytokines: its relevance to autoimmunity and allergy. Immunol Res. 1999, 20: 147-161. 10.1007/BF02786470.View ArticlePubMedGoogle Scholar
  18. Thomas R, Thieffry D, Kaufman M: Dynamical behaviour of biological regulatory networks-I. Biological role of feedback loops and practical use of the concept of the loop-characteristic state. Bull Math Biol. 1995, 57: 247-276.View ArticlePubMedGoogle Scholar
  19. Asnagli H, Murphy KM: Stability and commitment in T helper cell development. Curr Opin Immunol. 2001, 13: 242-247. 10.1016/S0952-7915(00)00210-7.View ArticlePubMedGoogle Scholar
  20. GNU Octave. [http://www.gnu.org/software/octave]
  21. Le Novère N, Bornstein B, Broicher A, Courtot M, Donizelli M, Dharuri H, Li L, Sauro H, Schilstra M, Shapiro B, Snoep JL, Hucka M: BioModels Database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems. Nucleic Acids Res. 2006, 34: D689-D691. 10.1093/nar/gkj092.PubMed CentralView ArticlePubMedGoogle Scholar
  22. Gonzalez AG, Naldi A, Sanchez L, Thieffry D, Chaouiya C: GINsim: a software suite for the qualitative modelling, simulation and analysis of regulatory networks. Biosystems. 2006, 84: 91-100. 10.1016/j.biosystems.2005.10.003.View ArticlePubMedGoogle Scholar
  23. De Jong H, Geiselmann J, Hernandez C, Page M: Genetic Network Analyzer: qualitative simulation of genetic regulatory networks. Bioinformatics. 2003, 19: 336-344. 10.1093/bioinformatics/btf851.View ArticlePubMedGoogle Scholar
  24. Klamt S, Saez-Rodriguez J, Gilles ED: Structural and functional analysis of cellular networks with CellNetAnalyzer. BMC Syst Biol. 2007, 1: 2-10.1186/1752-0509-1-2.PubMed CentralView ArticlePubMedGoogle Scholar
  25. De Jong H, Gouzé JL, Hernandez C, Page M, Sari T, Geiselmann J: Hybrid modeling and simulation of genetic regulatory networks: A qualitative approach. Lect Notes Comput Sci. 2003, 2623: 267-282.View ArticleGoogle Scholar
  26. González A, Chaouiya C, Thieffry D: Dynamical analysis of the regulatory network defining the dorsal-ventral boundary of the Drosophila wing imaginal disc. Genetics. 2006, 174: 1625-1634. 10.1534/genetics.106.061218.PubMed CentralView ArticlePubMedGoogle Scholar
  27. Klamt S, Saez-Rodriguez J, Lindquist JA, Simeoni L, Gilles ED: A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinformatics. 2006, 7: 56-10.1186/1471-2105-7-56.PubMed CentralView ArticlePubMedGoogle Scholar
  28. Kahlem P, Birney E: Dry work in a wet world: computation in systems biology. Mol Syst Biol. 2006, 2: 40-10.1038/msb4100080.PubMed CentralView ArticlePubMedGoogle Scholar
  29. ENFIN network. [http://www.enfin.org]
  30. SQUAD. [http://www.enfin.org/squad]

Copyright

© Di Cara et al; licensee BioMed Central Ltd. 2007

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Advertisement