Dynamical and structural analysis of a T cell survival network identifies novel candidate therapeutic targets for large granular lymphocyte leukemia

Modular Control of Biological Networks

The concept of control is central to understanding and applications of biological network models. Some of their key structural features relate to control functions, through gene regulation, signaling, or metabolic mechanisms, and computational models need to encode these. Applications of models often focus on model-based control, such as in biomedicine or metabolic engineering. This paper presents an approach to model-based control that exploits two common features of biological networks, namely their modular structure and canalizing features of their regulatory mechanisms. The paper focuses on intracellular regulatory networks, represented by Boolean network models. A main result of this paper is that control strategies can be identified by focusing on one module at a time. This paper also presents a criterion based on canalizing features of the regulatory rules to identify modules that do not contribute to network control and can be excluded. For even moderately sized networks, finding global control inputs is computationally very challenging. The modular approach presented here leads to a highly efficient approach to solving this problem. This approach is applied to a published Boolean network model of blood cancer large granular lymphocyte (T-LGL) leukemia to identify a minimal control set that achieves a desired control objective.

Set stabilization of logical control networks: A minimum node control approach

In network systems, control using minimum nodes or pinning control can be effectively used for stabilization problems to cut down the cost of control. In this paper, we investigate the set stabilization problem of logical control networks. In particular, we study the set stabilization problem of probabilistic Boolean networks (PBNs) and probabilistic Boolean control networks (PBCNs) via controlling minimal nodes. Firstly, an algorithm is given to search for the minimum index set of pinning nodes. Then, based on the analysis of its high computational complexity, we present optimized algorithms with lower computational complexity to ascertain the network control using minimum node sets. Moreover, some sufficient and necessary conditions are proposed to ensure the feasibility and effectiveness of the proposed algorithms. Furthermore, a theorem is presented for PBCNs to devise all state-feedback controllers corresponding to the set of pinning nodes. Finally, two models of gene regulatory networks are considered to show the efficacy of obtained results.

Discrete-state models identify pathway specific B cell states across diseases and infections at single-cell resolution

Oxygen (O2) regulated pathways modulate B cell activation, migration and proliferation during infection, vaccination, and other diseases. Modeling these pathways in health and disease is critical to understand B cell states and ways to mediate them. To characterize B cells by their activation of O2 regulated pathways we develop pathway specific discrete state models using previously published single-cell RNA-sequencing (scRNA-seq) datasets from isolated B cells. Specifically, Single Cell Boolean Omics Network Invariant-Time Analysis (scBONITA) was used to infer logic gates for known pathway topologies. The simplest inferred set of logic gates that maximized the number of "OR" interactions between genes was used to simulate B cell networks involved in oxygen sensing until they reached steady network states (attractors). By focusing on the attractors that best represented sequenced cells, we identified genes critical in determining pathway specific cellular states that corresponded to diseased and healthy B cell phenotypes. Specifically, we investigate the transendothelial migration, regulation of actin cytoskeleton, HIF1A, and Citrate Cycle pathways. Our analysis revealed attractors that resembled the state of B cell exhaustion in HIV+ patients as well as attractors that promoted anerobic metabolism, angiogenesis, and tumorigenesis in breast cancer patients, which were eliminated after neoadjuvant chemotherapy (NACT). Finally, we investigated the attractors to which the Azimuth-annotated B cells mapped and found that attractors resembling B cells from HIV+ patients encompassed a significantly larger number of atypical memory B cells than HIV- attractors. Meanwhile, attractors resembling B cells from breast cancer patients post NACT encompassed a reduced number of atypical memory B cells compared to pre-NACT attractors.

Biologically meaningful regulatory logic enhances the convergence rate in Boolean networks and bushiness of their state transition graph

Boolean models of gene regulatory networks (GRNs) have gained widespread traction as they can easily recapitulate cellular phenotypes via their attractor states. Their overall dynamics are embodied in a state transition graph (STG). Indeed, two Boolean networks (BNs) with the same network structure and attractors can have drastically different STGs depending on the type of Boolean functions (BFs) employed. Our objective here is to systematically delineate the effects of different classes of BFs on the structural features of the STG of reconstructed Boolean GRNs while keeping network structure and biological attractors fixed, and explore the characteristics of BFs that drive those features. Using $10$ reconstructed Boolean GRNs, we generate ensembles that differ in BFs and compute from their STGs the dynamics' rate of contraction or 'bushiness' and rate of 'convergence', quantified with measures inspired from cellular automata (CA) that are based on the garden-of-Eden (GoE) states. We find that biologically meaningful BFs lead to higher STG 'bushiness' and 'convergence' than random ones. Obtaining such 'global' measures gets computationally expensive with larger network sizes, stressing the need for feasible proxies. So we adapt Wuensche's $Z$-parameter in CA to BFs in BNs and provide four natural variants, which, along with the average sensitivity of BFs computed at the network level, comprise our descriptors of local dynamics and we find some of them to be good proxies for bushiness. Finally, we provide an excellent proxy for the 'convergence' based on computing transient lengths originating at random states rather than GoE states.

Modulating the dynamics of NFκB and PI3K enhances the ensemble-level TNFR1 signaling mediated apoptotic response

Cell-to-cell variability during TNFα stimulated Tumor Necrosis Factor Receptor 1 (TNFR1) signaling can lead to single-cell level pro-survival and apoptotic responses. This variability stems from the heterogeneity in signal flow through intracellular signaling entities that regulate the balance between these two phenotypes. Using systematic Boolean dynamic modeling of a TNFR1 signaling network, we demonstrate that the signal flow path variability can be modulated to enable cells favour apoptosis. We developed a computationally efficient approach "Boolean Modeling based Prediction of Steady-state probability of Phenotype Reachability (BM-ProSPR)" to accurately predict the network's ability to settle into different phenotypes. Model analysis juxtaposed with the experimental observations revealed that NFκB and PI3K transient responses guide the XIAP behaviour to coordinate the crucial dynamic cross-talk between the pro-survival and apoptotic arms at the single-cell level. Model predicted the experimental observations that ~31% apoptosis increase can be achieved by arresting Comp1 - IKK* activity which regulates the NFκB and PI3K dynamics. Arresting Comp1 - IKK* activity causes signal flow path re-wiring towards apoptosis without significantly compromising NFκB levels, which govern adequate cell survival. Priming an ensemble of cancerous cells with inhibitors targeting the specific interaction involving Comp1 and IKK* prior to TNFα exposure could enable driving them towards apoptosis.

Phenotype Control techniques for Boolean gene regulatory networks

Modeling cell signal transduction pathways via Boolean networks (BNs) has become an established method for analyzing intracellular communications over the last few decades. What's more, BNs provide a course-grained approach, not only to understanding molecular communications, but also for targeting pathway components that alter the long-term outcomes of the system. This has come to be known as phenotype control theory. In this review we study the interplay of various approaches for controlling gene regulatory networks such as: algebraic methods, control kernel, feedback vertex set, and stable motifs. The study will also include comparative discussion between the methods, using an established cancer model of T-Cell Large Granular Lymphocyte Leukemia. Further, we explore possible options for making the control search more efficient using reduction and modularity. Finally, we will include challenges presented such as the complexity and the availability of software for implementing each of these control techniques.

Normalizing Input-Output Relationships of Cancer Networks for Reversion Therapy

Accumulated genetic alterations in cancer cells distort cellular stimulus-response (or input-output) relationships, resulting in uncontrolled proliferation. However, the complex molecular interaction network within a cell implicates a possibility of restoring such distorted input-output relationships by rewiring the signal flow through controlling hidden molecular switches. Here, a system framework of analyzing cellular input-output relationships in consideration of various genetic alterations and identifying possible molecular switches that can normalize the distorted relationships based on Boolean network modeling and dynamics analysis is presented. Such reversion is demonstrated by the analysis of a number of cancer molecular networks together with a focused case study on bladder cancer with in vitro experiments and patient survival data analysis. The origin of reversibility from an evolutionary point of view based on the redundancy and robustness intrinsically embedded in complex molecular regulatory networks is further discussed.

Phenotype control techniques for Boolean gene regulatory networks

Modeling cell signal transduction pathways via Boolean networks (BNs) has become an established method for analyzing intracellular communications over the last few decades. What’s more, BNs provide a course-grained approach, not only to understanding molecular communications, but also for targeting pathway components that alter the long-term outcomes of the system. This has come to be known as phenotype control theory . In this review we study the interplay of various approaches for controlling gene regulatory networks such as: algebraic methods, control kernel, feedback vertex set, and stable motifs. The study will also include comparative discussion between the methods, using an established cancer model of T-Cell Large Granular Lymphocyte (T-LGL) Leukemia. Further, we explore possible options for making the control search more efficient using reduction and modularity. Finally, we will include challenges presented such as the complexity and the availability of software for implementing each of these control techniques.

Temporary and permanent control of partially specified Boolean networks

Boolean networks (BNs) are a well-accepted modelling formalism in computational systems biology. Nevertheless, modellers often cannot identify only a single BN that matches the biological reality. The typical reasons for this is insufficient knowledge or a lack of experimental data. Formally, this uncertainty can be expressed using partially specified Boolean networks (PSBNs), which encode the wide range of network candidates into a single structure. In this paper, we target the control of PSBNs. The goal of BN control is to find perturbations which guarantee stabilisation of the system in the desired state. Specifically, we consider variable perturbations (gene knock-out and over-expression) with three types of application time-window: one-step, temporary, and permanent. While the control of fully specified BNs is a thoroughly explored topic, control of PSBNs introduces additional challenges that we address in this paper. In particular, the unspecified components of the model cause a significant amount of additional state space explosion. To address this issue, we propose a fully symbolic methodology that can represent the numerous system variants in a compact form. In fully specified models, the efficiency of a perturbation is characterised by the count of perturbed variables (the perturbation size). However, in the case of a PSBN, a perturbation might work only for a subset of concrete BN models. To that end, we introduce and quantify perturbation robustness. This metric characterises how efficient the given perturbation is with respect to the model uncertainty. Finally, we evaluate the novel control methods using non-trivial real-world PSBN models. We inspect the method's scalability and efficiency with respect to the size of the state space and the number of unspecified components. We also compare the robustness metrics for all three perturbation types. Our experiments support the hypothesis that one-step perturbations are significantly less robust than temporary and permanent ones.

Relative importance of composition structures and biologically meaningful logics in bipartite Boolean models of gene regulation

Boolean networks have been widely used to model gene networks. However, such models are coarse-grained to an extent that they abstract away molecular specificities of gene regulation. Alternatively, bipartite Boolean network models of gene regulation explicitly distinguish genes from transcription factors (TFs). In such bipartite models, multiple TFs may simultaneously contribute to gene regulation by forming heteromeric complexes, thus giving rise to composition structures. Since bipartite Boolean models are relatively recent, an empirical investigation of their biological plausibility is lacking. Here, we estimate the prevalence of composition structures arising through heteromeric complexes. Moreover, we present an additional mechanism where composition structures may arise as a result of multiple TFs binding to cis-regulatory regions and provide empirical support for this mechanism. Next, we compare the restriction in BFs imposed by composition structures and by biologically meaningful properties. We find that though composition structures can severely restrict the number of Boolean functions (BFs) driving a gene, the two types of minimally complex BFs, namely nested canalyzing functions (NCFs) and read-once functions (RoFs), are comparatively more restrictive. Finally, we find that composition structures are highly enriched in real networks, but this enrichment most likely comes from NCFs and RoFs.

Probabilistic edge weights fine-tune Boolean network dynamics

Biological systems are noisy by nature. This aspect is reflected in our experimental measurements and should be reflected in the models we build to better understand these systems. Noise can be especially consequential when trying to interpret specific regulatory interactions, i.e. regulatory network edges. In this paper, we propose a method to explicitly encode edge-noise in Boolean dynamical systems by probabilistic edge-weight (PEW) operators. PEW operators have two important features: first, they introduce a form of edge-weight into Boolean models through the noise, second, the noise is dependent on the dynamical state of the system, which enables more biologically meaningful modeling choices. Moreover, we offer a simple-to-use implementation in the already well-established BooleanNet framework. In two application cases, we show how the introduction of just a few PEW operators in Boolean models can fine-tune the emergent dynamics and increase the accuracy of qualitative predictions. This includes fine-tuning interactions which cause non-biological behaviors when switching between asynchronous and synchronous update schemes in dynamical simulations. Moreover, PEW operators also open the way to encode more exotic cellular dynamics, such as cellular learning, and to implementing edge-weights for regulatory networks inferred from omics data.

On the Distribution of Successor States in Boolean Threshold Networks

We study the distribution of successor states in Boolean networks (BNs). The state vector y is called a successor of x if y = F(x) holds, where x, y ∈ {0,1}ⁿ are state vectors and F is an ordered set of Boolean functions describing the state transitions. This problem is motivated by analyzing how information propagates via hidden layers in Boolean threshold networks (discrete model of neural networks) and is kept or lost during time evolution in BNs. In this article, we measure the distribution via entropy and study how entropy changes via the transition from x to y , assuming that x is given uniformly at random. We focus on BNs consisting of exclusive OR (XOR) functions, canalyzing functions, and threshold functions. As a main result, we show that there exists a BN consisting of d -ary XOR functions, which preserves the entropy if d is odd and , whereas there does not exist such a BN if d is even. We also show that there exists a specific BN consisting of d -ary threshold functions, which preserves the entropy if [Formula: see text]. Furthermore, we theoretically analyze the upper and lower bounds of the entropy for BNs consisting of canalyzing functions and perform computational experiments using BN models of real biological networks.

A hybrid model to study how late long-term potentiation is affected by faulty molecules in an intraneuronal signaling network regulating transcription factor CREB

Systems biology analysis of intracellular signaling networks has tremendously expanded our understanding of normal and diseased cell behaviors and has revealed paths to finding proper therapeutic molecular targets. When it comes to neurons in the human brain, analysis of intraneuronal signaling networks provides invaluable information on learning, memory and cognition-related disorders, as well as potential therapeutic targets. However, neurons in the human brain form a highly complex neural network that, among its many roles, is also responsible for learning, memory formation and cognition. Given the impairment of these processes in mental and psychiatric disorders, one can envision that analyzing interneuronal processes, together with analyzing intraneuronal signaling networks, can result in a better understanding of the pathology and, subsequently, more effective target discovery. In this paper, a hybrid model is introduced, composed of the long-term potentiation (LTP) interneuronal process and an intraneuronal signaling network regulating CREB. LTP refers to an increased synaptic strength over a long period of time among neurons, typically induced upon occurring an activity that generates high-frequency stimulations (HFS) in the brain, and CREB is a transcription factor known to be highly involved in important functions of the cognitive and executive human brain such as learning and memory. The hybrid LTP-signaling model is analyzed using a proposed molecular fault diagnosis method. It allows to study the importance of various signaling molecules according to how much they affect an intercellular phenomenon when they are faulty, i.e. dysfunctional. This paper is intended to suggest another angle for understanding the pathology and therapeutic target discovery by classifying and ranking various intraneuronal signaling molecules based on how much their faulty behaviors affect an interneuronal process. Possible relations between the introduced hybrid analysis and the previous purely intracellular analysis are investigated in the paper as well.

Influence maximization in Boolean networks

The optimization problem aiming at the identification of minimal sets of nodes able to drive the dynamics of Boolean networks toward desired long-term behaviors is central for some applications, as for example the detection of key therapeutic targets to control pathways in models of biological signaling and regulatory networks. Here, we develop a method to solve such an optimization problem taking inspiration from the well-studied problem of influence maximization for spreading processes in social networks. We validate the method on small gene regulatory networks whose dynamical landscapes are known by means of brute-force analysis. We then systematically study a large collection of gene regulatory networks. We find that for about 65% of the analyzed networks, the minimal driver sets contain less than 20% of their nodes.

Structure-based approach to identifying small sets of driver nodes in biological networks

In network control theory, driving all the nodes in the Feedback Vertex Set (FVS) by node-state override forces the network into one of its attractors (long-term dynamic behaviors). The FVS is often composed of more nodes than can be realistically manipulated in a system; for example, only up to three nodes can be controlled in intracellular networks, while their FVS may contain more than 10 nodes. Thus, we developed an approach to rank subsets of the FVS on Boolean models of intracellular networks using topological, dynamics-independent measures. We investigated the use of seven topological prediction measures sorted into three categories-centrality measures, propagation measures, and cycle-based measures. Using each measure, every subset was ranked and then evaluated against two dynamics-based metrics that measure the ability of interventions to drive the system toward or away from its attractors: To Control and Away Control. After examining an array of biological networks, we found that the FVS subsets that ranked in the top according to the propagation metrics can most effectively control the network. This result was independently corroborated on a second array of different Boolean models of biological networks. Consequently, overriding the entire FVS is not required to drive a biological network to one of its attractors, and this method provides a way to reliably identify effective FVS subsets without the knowledge of the network dynamics.

Identification of dynamic driver sets controlling phenotypical landscapes

Controlling phenotypical landscapes is of vital interest to modern biology. This task becomes highly demanding because cellular decisions involve complex networks engaging in crosstalk interactions. Previous work on control theory indicates that small sets of compounds can control single phenotypes. However, a dynamic approach is missing to determine the drivers of the whole network dynamics. By analyzing 35 biologically motivated Boolean networks, we developed a method to identify small sets of compounds sufficient to decide on the entire phenotypical landscape. These compounds do not strictly prefer highly related compounds and show a smaller impact on the stability of the attractor landscape. The dynamic driver sets include many intervention targets and cellular reprogramming drivers in human networks. Finally, by using a new comprehensive model of colorectal cancer, we provide a complete workflow on how to implement our approach to shift from in silico to in vitro guided experiments.

Infinite-Horizon Optimal Control of Switched Boolean Control Networks With Average Cost: An Efficient Graph-Theoretical Approach

This study investigates the infinite-horizon optimal control (IHOC) problem for switched Boolean control networks with an average cost criterion. A primary challenge of this problem is the prohibitively high computational cost when dealing with large-scale networks. We attempt to develop a more efficient approach from a novel graph-theoretical perspective. First, a weighted directed graph structure called the optimal state transition graph (OSTG) is established, whose edges encode the optimal action for each admissible state transition between states reachable from a given initial state subject to various constraints. Then, we reduce the IHOC problem into a minimum-mean cycle (MMC) problem in the OSTG. Finally, we develop an algorithm that can quickly find a particular MMC by resorting to Karp's algorithm in the graph theory and construct an optimal switching control law based on state feedback. The time complexity analysis shows that our algorithm, albeit still running in exponential time, can outperform all the existing methods in terms of time efficiency. A 16-state-3-input signaling network in leukemia is used as a benchmark to test its effectiveness. Results show that the proposed graph-theoretical approach is much more computationally efficient and can reduce the running time dramatically: it runs hundreds or even thousands of times faster than the existing methods. The Python implementation of the algorithm is available at https://github.com/ShuhuaGao/sbcn_mmc.

Identification of periodic attractors in Boolean networks using a priori information

Boolean networks (BNs) have been developed to describe various biological processes, which requires analysis of attractors, the long-term stable states. While many methods have been proposed to detection and enumeration of attractors, there are no methods which have been demonstrated to be theoretically better than the naive method and be practically used for large biological BNs. Here, we present a novel method to calculate attractors based on a priori information, which works much and verifiably faster than the naive method. We apply the method to two BNs which differ in size, modeling formalism, and biological scope. Despite these differences, the method presented here provides a powerful tool for the analysis of both networks. First, our analysis of a BN studying the effect of the microenvironment during angiogenesis shows that the previously defined microenvironments inducing the specialized phalanx behavior in endothelial cells (ECs) additionally induce stalk behavior. We obtain this result from an extended network version which was previously not analyzed. Second, we were able to heuristically detect attractors in a cell cycle control network formalized as a bipartite Boolean model (bBM) with 3158 nodes. These attractors are directly interpretable in terms of genotype-to-phenotype relationships, allowing network validation equivalent to an in silico mutagenesis screen. Our approach contributes to the development of scalable analysis methods required for whole-cell modeling efforts.

Systems biology requires not only scalable formalization methods, but also means to analyze complex networks. Although Boolean networks (BNs) are a convenient way to formalize biological processes, their analysis suffers from the combinatorial complexity with increasing number of nodes n. Hence, the long standing O(2ⁿ) barrier for detection of periodic attractors in BNs has obstructed the development of large, biological BNs. We break this barrier by introducing a novel algorithm using a priori information. We show that the proposed algorithm enables systematic analysis of BNs formulated as bipartite models in the form of in silico mutagenesis screens.

Navigating Multi-Scale Cancer Systems Biology Towards Model-Driven Clinical Oncology and Its Applications in Personalized Therapeutics

Rapid advancements in high-throughput omics technologies and experimental protocols have led to the generation of vast amounts of scale-specific biomolecular data on cancer that now populates several online databases and resources. Cancer systems biology models built using this data have the potential to provide specific insights into complex multifactorial aberrations underpinning tumor initiation, development, and metastasis. Furthermore, the annotation of these single- and multi-scale models with patient data can additionally assist in designing personalized therapeutic interventions as well as aid in clinical decision-making. Here, we have systematically reviewed the emergence and evolution of (i) repositories with scale-specific and multi-scale biomolecular cancer data, (ii) systems biology models developed using this data, (iii) associated simulation software for the development of personalized cancer therapeutics, and (iv) translational attempts to pipeline multi-scale panomics data for data-driven in silico clinical oncology. The review concludes that the absence of a generic, zero-code, panomics-based multi-scale modeling pipeline and associated software framework, impedes the development and seamless deployment of personalized in silico multi-scale models in clinical settings.

Parity and time reversal elucidate both decision-making in empirical models and attractor scaling in critical Boolean networks

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.

Finding the fixed points of a Boolean network from a positive feedback vertex set

MOTIVATION

In the modeling of biological systems by Boolean networks, a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structural properties of the regulatory graph like those proposed by Akutsu et al. and Zhang et al., which consider a feedback vertex set of the graph. However, these methods do not take into account the type of action (activation and inhibition) between its components.

RESULTS

In this article, we propose a new algorithm for finding the set of fixed points of a Boolean network, based on a positive feedback vertex set P of its regulatory graph and which works, by applying a sequential update schedule, in time O(2|P|·n2+k), where n is the number of components and the regulatory functions of the network can be evaluated in time O(nk), k≥0. The theoretical foundation of this algorithm is due a nice characterization, that we give, of the dynamical behavior of the Boolean networks without positive cycles and with a fixed point.

AVAILABILITY AND IMPLEMENTATION

An executable file of FixedPoint algorithm made in Java and some examples of input files are available at: www.inf.udec.cl/˜lilian/FPCollector/.

SUPPLEMENTARY INFORMATION

Supplementary material is available at Bioinformatics online.

CLARINET: efficient learning of dynamic network models from literature

Motivation

Creating or extending computational models of complex systems, such as intra- and intercellular biological networks, is a time and labor-intensive task, often limited by the knowledge and experience of modelers. Automating this process would enable rapid, consistent, comprehensive and robust analysis and understanding of complex systems.

Results

In this work, we present CLARINET (CLARIfying NETworks), a novel methodology and a tool for automatically expanding models using the information extracted from the literature by machine reading. CLARINET creates collaboration graphs from the extracted events and uses several novel metrics for evaluating these events individually, in pairs, and in groups. These metrics are based on the frequency of occurrence and co-occurrence of events in literature, and their connectivity to the baseline model. We tested how well CLARINET can reproduce manually built and curated models, when provided with varying amount of information in the baseline model and in the machine reading output. Our results show that CLARINET can recover all relevant interactions that are present in the reading output and it automatically reconstructs manually built models with average recall of 80% and average precision of 70%. CLARINET is highly scalable, its average runtime is at the order of ten seconds when processing several thousand interactions, outperforming other similar methods.

Availability and implementation

The data underlying this article are available in Bitbucket at https://bitbucket.org/biodesignlab/clarinet/src/master/.

Supplementary information

Supplementary data are available at Bioinformatics Advances online.

The effective graph reveals redundancy, canalization, and control pathways in biochemical regulation and signaling

The ability to map causal interactions underlying genetic control and cellular signaling has led to increasingly accurate models of the complex biochemical networks that regulate cellular function. These network models provide deep insights into the organization, dynamics, and function of biochemical systems: for example, by revealing genetic control pathways involved in disease. However, the traditional representation of biochemical networks as binary interaction graphs fails to accurately represent an important dynamical feature of these multivariate systems: some pathways propagate control signals much more effectively than do others. Such heterogeneity of interactions reflects canalization-the system is robust to dynamical interventions in redundant pathways but responsive to interventions in effective pathways. Here, we introduce the effective graph, a weighted graph that captures the nonlinear logical redundancy present in biochemical network regulation, signaling, and control. Using 78 experimentally validated models derived from systems biology, we demonstrate that 1) redundant pathways are prevalent in biological models of biochemical regulation, 2) the effective graph provides a probabilistic but precise characterization of multivariate dynamics in a causal graph form, and 3) the effective graph provides an accurate explanation of how dynamical perturbation and control signals, such as those induced by cancer drug therapies, propagate in biochemical pathways. Overall, our results indicate that the effective graph provides an enriched description of the structure and dynamics of networked multivariate causal interactions. We demonstrate that it improves explainability, prediction, and control of complex dynamical systems in general and biochemical regulation in particular.

Logical modeling of thymus and natural killer lymphocyte differentiation

Thymus (T) and natural killer (NK) lymphocytes are important barriers against diseases. Therefore, it is necessary to understand regulatory mechanisms related to the cell fate decisions involved in the production of these cells. Although some individual information related to T and NK lymphocyte cell fate decisions have been revealed, the related network and its dynamical characteristics still have not been well understood. By integrating individual information and comparing with experimental data, we construct a comprehensive regulatory network and a logical model related to T and NK lymphocyte differentiation. We aim to explore possible mechanisms of how each lineage differentiation is realized by systematically screening individual perturbations. When determining the perturbation strategies, the state transition can be used to identify the roles of specific genes in cell type selection and reprogramming. In agreement with experimental observations, the dynamics of the model correctly restates the cell differentiation processes from common lymphoid progenitors to CD4+ T cells, CD8+ T cells, and NK cells. Our analysis reveals that some specific perturbations can give rise to directional cell differentiation or reprogramming. We test our in silico results by using known experimental observations. The integrated network and the logical model presented here might be a good candidate for providing qualitative mechanisms of cell fate specification involved in T and NK lymphocyte cell fate decisions.

Steady-State Design of Large-Dimensional Boolean Networks

Analysis and design of steady states representing cell types, such as cell death or unregulated growth, are of significant interest in modeling genetic regulatory networks. In this article, the steady-state design of large-dimensional Boolean networks (BNs) is studied via model reduction and pinning control. Compared with existing literature, the pinning control design in this article is based on the original node's connection, but not on the state-transition matrix of BNs. Hence, the computational complexity is dramatically reduced in this article from O(2ⁿ×2ⁿ) to O(2×2^r) , where n is the number of nodes in the large-dimensional BN and is the largest number of in-neighbors of the reduced BN. Finally, the proposed method is well demonstrated by a T-LGL survival signaling network with 18 nodes and a model of survival signaling in large granular lymphocyte leukemia with 29 nodes. Just as shown in the simulations, the model reduction method reduces 99.98% redundant states for the network with 18 nodes, and 99.99% redundant states for the network with 29 nodes.

Context-specific network modeling identifies new crosstalk in β-adrenergic cardiac hypertrophy

Cardiac hypertrophy is a context-dependent phenomenon wherein a myriad of biochemical and biomechanical factors regulate myocardial growth through a complex large-scale signaling network. Although numerous studies have investigated hypertrophic signaling pathways, less is known about hypertrophy signaling as a whole network and how this network acts in a context-dependent manner. Here, we developed a systematic approach, CLASSED (Context-specific Logic-bASed Signaling nEtwork Development), to revise a large-scale signaling model based on context-specific data and identify main reactions and new crosstalks regulating context-specific response. CLASSED involves four sequential stages with an automated validation module as a core which builds a logic-based ODE model from the interaction graph and outputs the model validation percent. The context-specific model is developed by estimation of default parameters, classified qualitative validation, hybrid Morris-Sobol global sensitivity analysis, and discovery of missing context-dependent crosstalks. Applying this pipeline to our prior-knowledge hypertrophy network with context-specific data revealed key signaling reactions which distinctly regulate cell response to isoproterenol, phenylephrine, angiotensin II and stretch. Furthermore, with CLASSED we developed a context-specific model of β-adrenergic cardiac hypertrophy. The model predicted new crosstalks between calcium/calmodulin-dependent pathways and upstream signaling of Ras in the ISO-specific context. Experiments in cardiomyocytes validated the model’s predictions on the role of CaMKII-Gβγ and CaN-Gβγ interactions in mediating hypertrophic signals in ISO-specific context and revealed a difference in the phosphorylation magnitude and translocation of ERK1/2 between cardiac myocytes and fibroblasts. CLASSED is a systematic approach for developing context-specific large-scale signaling networks, yielding insights into new-found crosstalks in β-adrenergic cardiac hypertrophy.

Pathological cardiac hypertrophy is a disease in which the heart grows abnormally in response to different motivators such as high blood pressure or variations in hormones and growth factors. The shape of the heart after its growth depends on the context in which it grows. Since cell signaling in the cardiac cells plays a key role in the determination of heart shape, a thorough understanding of cardiac cells signaling in each context enlightens the mechanisms which control response of cardiac cells. However, cell signaling in cardiac hypertrophy comprises a complex web of pathways with numerous interactions, and predicting how these interactions control the hypertrophic signal in each context is not achievable by only experiments or general computational models. To address this need, we developed an approach to bring together the experimental data of each context with a signaling network curated from literature to identify the main players of cardiac cells response in each context and attain the context-specific models of cardiac hypertrophy. By utilizing our approach, we identified the main regulators of cardiac hypertrophy in four important contexts. We developed a network model of β-adrenergic cardiac hypertrophy, and predicted and validated new interactions that regulate cardiac cells response in this context.

Insights on TAM Formation from a Boolean Model of Macrophage Polarization Based on In Vitro Studies

Simple Summary

The recent success of immunotherapy treatments against cancer relies on helping our own body’s defenses in the fight against tumours, namely reinvigorating the cancer killing action of T cells. Unfortunately, in a large proportion of patients these therapies are ineffective, in part due to the presence of other immune cells, macrophages, which are mis-educated by the cancer cells into promoting tumour growth. Here we start from an existing model of macrophage polarization and extend it to the specific conditions encountered inside a tumour by adding signals, receptors, transcription factors and cytokines that are known to be the key components in establishing the cancer cell-macrophage interaction. Then we use a mathematical Boolean model applied to a gene regulatory network of this biological process to simulate its temporal behaviour and explore scenarios that have not been experimentally tested so far. Additionally, the KO and overexpression simulations successfully reproduce the known experimental results while predicting the potential role of regulators (such as STAT1 and EGF) in preventing the formation of pro-tumoural macrophages, which can be tested experimentally.

Abstract

The tumour microenvironment is the surrounding of a tumour, including blood vessels, fibroblasts, signaling molecules, the extracellular matrix and immune cells, especially neutrophils and monocyte-derived macrophages. In a tumour setting, macrophages encompass a spectrum between a tumour-suppressive (M1) or tumour-promoting (M2) state. The biology of macrophages found in tumours (Tumour Associated Macrophages) remains unclear, but understanding their impact on tumour progression is highly important. In this paper, we perform a comprehensive analysis of a macrophage polarization network, following two lines of enquiry: (i) we reconstruct the macrophage polarization network based on literature, extending it to include important stimuli in a tumour setting, and (ii) we build a dynamical model able to reproduce macrophage polarization in the presence of different stimuli, including the contact with cancer cells. Our simulations recapitulate the documented macrophage phenotypes and their dependencies on specific receptors and transcription factors, while also unravelling the formation of a special type of tumour associated macrophages in an in vitro model of chronic lymphocytic leukaemia. This model constitutes the first step towards elucidating the cross-talk between immune and cancer cells inside tumours, with the ultimate goal of identifying new therapeutic targets that could control the formation of tumour associated macrophages in patients.

FPGA Accelerated Analysis of Boolean Gene Regulatory Networks

Boolean models are a powerful abstraction for qualitative modeling of gene regulatory networks. With the recent availability of advanced high-throughput technologies, Boolean models have increasingly grown in size and complexity, posing a challenge for existing software simulation tools that have not scaled at the same speed. Field Programmable Gate Arrays (FPGAs) are powerful reconfigurable integrated circuits that can offer massive performance improvements. Due to their highly parallel nature, FPGAs are well suited to simulate complex molecular networks. We present here a new simulation framework for Boolean models, which first converts the model to Verilog, a standardized hardware description language, and then connects it to an execution core that runs on an FPGA coherently attached to a POWER8 processor. We report an order of magnitude speedup over a multi-threaded software simulation tool running on the same processor on a selection of Boolean models. Analysis on a T-cell large granular lymphocyte leukemia (T-LGL) demonstrates that our framework achieves consistent performance improvements resulting in new biological insights. In addition, we show that our solution allows to perform attractor detection at an unprecedented speed, exhibiting a speedup ranging from one to three orders of magnitude compared to alternative software solutions.

Antifragility Predicts the Robustness and Evolvability of Biological Networks through Multi-Class Classification with a Convolutional Neural Network

Robustness and evolvability are essential properties to the evolution of biological networks. To determine if a biological network is robust and/or evolvable, it is required to compare its functions before and after mutations. However, this sometimes takes a high computational cost as the network size grows. Here, we develop a predictive method to estimate the robustness and evolvability of biological networks without an explicit comparison of functions. We measure antifragility in Boolean network models of biological systems and use this as the predictor. Antifragility occurs when a system benefits from external perturbations. By means of the differences of antifragility between the original and mutated biological networks, we train a convolutional neural network (CNN) and test it to classify the properties of robustness and evolvability. We found that our CNN model successfully classified the properties. Thus, we conclude that our antifragility measure can be used as a predictor of the robustness and evolvability of biological networks.

A Near-Optimal Control Method for Stochastic Boolean Networks

One of the ultimate goals in systems biology is to develop control strategies to find efficient medical treatments. One step towards this goal is to develop methods for changing the state of a cell into a desirable state. We propose an efficient method that determines combinations of network perturbations to direct the system towards a predefined state. The method requires a set of control actions such as the silencing of a gene or the disruption of the interaction between two genes. An optimal control policy defined as the best intervention at each state of the system can be obtained using existing methods. However, these algorithms are computationally prohibitive for models with tens of nodes. Our method generates control actions that approximates the optimal control policy with high probability with a computational efficiency that does not depend on the size of the state space. Our C++ code is available at https://github.com/boaguilar/SDDScontrol.

Concepts in Boolean network modeling: What do they all mean?

Boolean network models are one of the simplest models to study complex dynamic behavior in biological systems. They can be applied to unravel the mechanisms regulating the properties of the system or to identify promising intervention targets. Since its introduction by Stuart Kauffman in 1969 for describing gene regulatory networks, various biologically based networks and tools for their analysis were developed. Here, we summarize and explain the concepts for Boolean network modeling. We also present application examples and guidelines to work with and analyze Boolean network models.

Control of Intracellular Molecular Networks Using Algebraic Methods

Many problems in biology and medicine have a control component. Often, the goal might be to modify intracellular networks, such as gene regulatory networks or signaling networks, in order for cells to achieve a certain phenotype, what happens in cancer. If the network is represented by a mathematical model for which mathematical control approaches are available, such as systems of ordinary differential equations, then this problem might be solved systematically. Such approaches are available for some other model types, such as Boolean networks, where structure-based approaches have been developed, as well as stable motif techniques. However, increasingly many published discrete models are mixed-state or multistate, that is, some or all variables have more than two states, and thus the development of control strategies for multistate networks is needed. This paper presents a control approach broadly applicable to general multistate models based on encoding them as polynomial dynamical systems over a finite algebraic state set, and using computational algebra for finding appropriate intervention strategies. To demonstrate the feasibility and applicability of this method, we apply it to a recently developed multistate intracellular model of E2F-mediated bladder cancerous growth and to a model linking intracellular iron metabolism and oncogenic pathways. The control strategies identified for these published models are novel in some cases and represent new hypotheses, or are supported by the literature in others as potential drug targets. Our Macaulay2 scripts to find control strategies are publicly available through GitHub at https://github.com/luissv7/multistatepdscontrol.

Minimal intervening control of biomolecular networks leading to a desired cellular state

A cell phenotype can be represented by an attractor state of the underlying molecular regulatory network, to which other network states eventually converge. Here, the set of states converging to each attractor is called its basin of attraction. A central question is how to drive a particular cell state toward a desired attractor with minimal interventions on the network system. We develop a general control framework of complex Boolean networks to provide an answer to this question by identifying control targets on which one-time temporary perturbation can induce a state transition to the boundary of a desired attractor basin. Examples are shown to illustrate the proposed control framework which is also applicable to other types of complex Boolean networks.

Pinning Controllers for Activation Output Tracking of Boolean Network Under One-Bit Perturbation

This paper studies pinning controllers for activation output tracking (AOT) of Boolean network under one-bit perturbation, based on the semitensor product of matrices. First, the definition of AOT with respect to an activation number is presented, where the activation number means the number of active outputs whose logical variables are 1 s. Then, several criteria are established for AOT issue. Further, the impact of one-bit perturbation on AOT is studied, where one-bit perturbation means that only one logical function has one-bit change of its truth table by flipping the value from 1 to 0 or 0 to 1. In addition, if a one-bit perturbation is a valid perturbation on AOT, an output feedback pinning control is designed to recover AOT. The obtained results are effectively illustrated by a D. melanogaster segmentation polarity gene network and a reduced signal transduction network.

Fast-Time Stability of Temporal Boolean Networks

In real systems, most of the biological functionalities come from the fact that the connections are not active all the time. Based on the fact, temporal Boolean networks (TBNs) are proposed in this paper, and the fast-time stability is analyzed via semi-tensor product (STP) of matrices and incidence matrices. First, the algebraic form of a TBN is obtained based on the STP method, and one necessary and sufficient condition for global fast-time stability is presented. Moreover, incidence matrices are used to obtain several sufficient conditions, which reduce the computational complexity from O(n2ⁿ) (exponential type) to O(n⁴) (polynomial type) compared with the STP method. In addition, the global fast-time stabilization of TBNs is considered, and pinning controllers are designed based on the neighbors of controlled nodes rather than all the nodes. Finally, the local fast-time stability of TBNs is considered based on the incidence matrices as well. Several examples are provided to illustrate the effectiveness of the obtained results.

A mathematical model of combined CD8 T cell costimulation by 4-1BB (CD137) and OX40 (CD134) receptors

Combined agonist stimulation of the TNFR costimulatory receptors 4-1BB (CD137) and OX40(CD134) has been shown to generate supereffector CD8 T cells that clonally expand to greater levels, survive longer, and produce a greater quantity of cytokines compared to T cells stimulated with an agonist of either costimulatory receptor individually. In order to understand the mechanisms for this effect, we have created a mathematical model for the activation of the CD8 T cell intracellular signaling network by mono- or dual-costimulation. We show that supereffector status is generated via downstream interacting pathways that are activated upon engagement of both receptors, and in silico simulations of the model are supported by published experimental results. The model can thus be used to identify critical molecular targets of T cell dual-costimulation in the context of cancer immunotherapy.

Scalable optimal Bayesian classification of single-cell trajectories under regulatory model uncertainty

Background

Single-cell gene expression measurements offer opportunities in deriving mechanistic understanding of complex diseases, including cancer. However, due to the complex regulatory machinery of the cell, gene regulatory network (GRN) model inference based on such data still manifests significant uncertainty.

Results

The goal of this paper is to develop optimal classification of single-cell trajectories accounting for potential model uncertainty. Partially-observed Boolean dynamical systems (POBDS) are used for modeling gene regulatory networks observed through noisy gene-expression data. We derive the exact optimal Bayesian classifier (OBC) for binary classification of single-cell trajectories. The application of the OBC becomes impractical for large GRNs, due to computational and memory requirements. To address this, we introduce a particle-based single-cell classification method that is highly scalable for large GRNs with much lower complexity than the optimal solution.

Conclusion

The performance of the proposed particle-based method is demonstrated through numerical experiments using a POBDS model of the well-known T-cell large granular lymphocyte (T-LGL) leukemia network with noisy time-series gene-expression data.

Electronic supplementary material

The online version of this article (10.1186/s12864-019-5720-3) contains supplementary material, which is available to authorized users.

Next Generation Networks: Featuring the Potential Role of Emerging Applications in Translational Oncology

Nowadays, networks are pervasively used as examples of models suitable to mathematically represent and visualize the complexity of systems associated with many diseases, including cancer. In the cancer context, the concept of network entropy has guided many studies focused on comparing equilibrium to disequilibrium (i.e., perturbed) conditions. Since these conditions reflect both structural and dynamic properties of network interaction maps, the derived topological characterizations offer precious support to conduct cancer inference. Recent innovative directions have emerged in network medicine addressing especially experimental omics approaches integrated with a variety of other data, from molecular to clinical and also electronic records, bioimaging etc. This work considers a few theoretically relevant concepts likely to impact the future of applications in personalized/precision/translational oncology. The focus goes to specific properties of networks that are still not commonly utilized or studied in the oncological domain, and they are: controllability, synchronization and symmetry. The examples here provided take inspiration from the consideration of metastatic processes, especially their progression through stages and their hallmark characteristics. Casting these processes into computational frameworks and identifying network states with specific modular configurations may be extremely useful to interpret or even understand dysregulation patterns underlying cancer, and associated events (onset, progression) and disease phenotypes.

Identification of regulatory variables for state transition of biological networks

Attractors represent steady states of biological networks. Recent studies have shown that regulatory variables can be used to steer a network state transition from an undesired attractor, such as a cancerous state, to a desired healthy one. Therefore, it is important to identify the regulatory variables and determine their time-dependent profile for state transition of a given network. However, this is a challenging task since regulatory variables have to be identified among numerous candidates in a large-scale biological network. In this study, we developed a new method for identifying regulatory variables in large-scale biological networks for the purpose of state transition. As a result, a set of optimal regulatory variables can be determined based on formulating and solving a mixed-integer nonlinear dynamic optimization problem. A relaxation scheme is used to overcome the difficulties in solving this complex problem containing a large number of binary variables. The solution to this problem simultaneously identifies the optimal regulatory variables, provides strength of regulatory interactions, and obtains the minimal control time to realize the required state transition. In addition, by adjusting the objective function, various combinations of the strength of regulatory interactions and the transition time can be achieved according to the requirement for disease therapy. Results of three case studies (a myeloid differentiation regulatory network, a cancer gene regulatory network, and a T-LGL signaling network) demonstrate the efficacy of the proposed approach. Therefore, this study establishes an appropriate framework for identifying the regulatory variables for state transition of complex biological networks.

A Boolean network control algorithm guided by forward dynamic programming

Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state. Boolean networks are utilized as a mathematical model for gene regulatory networks. This paper provides an algorithm to solve the control problem in Boolean networks. The proposed algorithm is implemented and applied on two biological systems: T-cell receptor network and Drosophila melanogaster network. Results show that the proposed algorithm works faster in solving the control problem over these networks, while having similar accuracy, in comparison to previous exact methods. Source code and a simple web service of the proposed algorithm is available at http://goliaei.ir/net-control/www/.

Edgetic perturbations to eliminate fixed-point attractors in Boolean regulatory networks

The dynamics of complex biological networks may be modeled in a Boolean framework, where the state of each system component is either abundant (ON) or scarce/absent (OFF), and each component's dynamic trajectory is determined by a logical update rule involving the state(s) of its regulator(s). It is possible to encode the update rules in the topology of the so-called expanded graph, analysis of which reveals the long-term behavior, or attractors, of the network. Here, we develop an algorithm to perturb the expanded graph (or, equivalently, the logical update rules) to eliminate stable motifs: subgraphs that cause a subset of components to stabilize to one state. Depending on the topology of the expanded graph, these perturbations lead to the modification or loss of the corresponding attractor. While most perturbations of biological regulatory networks in the literature involve the knockout (fixing to OFF) or constitutive activation (fixing to ON) of one or more nodes, we here consider edgetic perturbations, where a node's update rule is modified such that one or more of its regulators is viewed as ON or OFF regardless of its actual state. We apply the methodology to two biological networks. In a network representing T-LGL leukemia, we identify edgetic perturbations that eliminate the cancerous attractor, leaving only the healthy attractor representing cell death. In a network representing drought-induced closure of plant stomata, we identify edgetic perturbations that modify the single attractor such that stomata, instead of being fixed in the closed state, oscillates between the open and closed states.

On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors

It is known that many driver nodes are required to control complex biological networks. Previous studies imply that O(N) driver nodes are required in both linear complex network and Boolean network models with N nodes if an arbitrary state is specified as the target. In order to cope with this intrinsic difficulty, we consider a special case of the control problem in which the targets are restricted to attractors. For this special case, we mathematically prove under the uniform distribution of states in basins that the expected number of driver nodes is only O(log₂N+log₂M) for controlling Boolean networks, where M is the number of attractors. Since it is expected that M is not very large in many practical networks, the new model requires a much smaller number of driver nodes. This result is based on discovery of novel relationships between control problems on Boolean networks and the coupon collector's problem, a well-known concept in combinatorics. We also provide lower bounds of the number of driver nodes as well as simulation results using artificial and realistic network data, which support our theoretical findings.

A Novel Data-Driven Boolean Model for Genetic Regulatory Networks

A Boolean model is a simple, discrete and dynamic model without the need to consider the effects at the intermediate levels. However, little effort has been made into constructing activation, inhibition, and protein decay networks, which could indicate the direct roles of a gene (or its synthesized protein) as an activator or inhibitor of a target gene. Therefore, we propose to focus on the general Boolean functions at the subfunction level taking into account the effectiveness of protein decay, and further split the subfunctions into the activation and inhibition domains. As a consequence, we developed a novel data-driven Boolean model; namely, the Fundamental Boolean Model (FBM), to draw insights into gene activation, inhibition, and protein decay. This novel Boolean model provides an intuitive definition of activation and inhibition pathways and includes mechanisms to handle protein decay issues. To prove the concept of the novel model, we implemented a platform using R language, called FBNNet. Our experimental results show that the proposed FBM could explicitly display the internal connections of the mammalian cell cycle between genes separated into the connection types of activation, inhibition and protein decay. Moreover, the method we proposed to infer the gene regulatory networks for the novel Boolean model can be run in parallel and; hence, the computation cost is affordable. Finally, the novel Boolean model and related Fundamental Boolean Networks (FBNs) could show significant trajectories in genes to reveal how genes regulated each other over a given period. This new feature could facilitate further research on drug interventions to detect the side effects of a newly-proposed drug.

State observation and sensor selection for nonlinear networks

A large variety of dynamical systems, such as chemical and biomolecular systems, can be seen as networks of nonlinear entities. Prediction, control, and identification of such nonlinear networks require knowledge of the state of the system. However, network states are usually unknown, and only a fraction of the state variables are directly measurable. The observability problem concerns reconstructing the network state from this limited information. Here, we propose a general optimization-based approach for observing the states of nonlinear networks and for optimally selecting the observed variables. Our results reveal several fundamental limitations in network observability, such as the trade-off between the fraction of observed variables and the observation length on one side, and the estimation error on the other side. We also show that, owing to the crucial role played by the dynamics, purely graph-theoretic observability approaches cannot provide conclusions about one's practical ability to estimate the states. We demonstrate the effectiveness of our methods by finding the key components in biological and combustion reaction networks from which we determine the full system state. Our results can lead to the design of novel sensing principles that can greatly advance prediction and control of the dynamics of such networks.

Automatic Screening for Perturbations in Boolean Networks

A common approach to address biological questions in systems biology is to simulate regulatory mechanisms using dynamic models. Among others, Boolean networks can be used to model the dynamics of regulatory processes in biology. Boolean network models allow simulating the qualitative behavior of the modeled processes. A central objective in the simulation of Boolean networks is the computation of their long-term behavior—so-called attractors. These attractors are of special interest as they can often be linked to biologically relevant behaviors. Changing internal and external conditions can influence the long-term behavior of the Boolean network model. Perturbation of a Boolean network by stripping a component of the system or simulating a surplus of another element can lead to different attractors. Apparently, the number of possible perturbations and combinations of perturbations increases exponentially with the size of the network. Manually screening a set of possible components for combinations that have a desired effect on the long-term behavior can be very time consuming if not impossible. We developed a method to automatically screen for perturbations that lead to a user-specified change in the network's functioning. This method is implemented in the visual simulation framework ViSiBool utilizing satisfiability (SAT) solvers for fast exhaustive attractor search.

Method for identification of sensitive nodes in Boolean models of biological networks

Biological systems are often represented as Boolean networks and analysed to identify sensitive nodes which on perturbation disproportionately change a predefined output. There exist different kinds of perturbation methods: perturbation of function, perturbation of state and perturbation in update scheme. Nodes may have defects in interpretation of the inputs from other nodes and calculation of the node output. To simulate these defects and systematically assess their effect on the system output, two new function perturbations, referred to as ‘not of function’ and ‘function of not’, are introduced. In the former, the inputs are assumed to be correctly interpreted but the output of the update rule is perturbed; and in the latter, each input is perturbed but the correct update rule is applied. These and previously used perturbation methods were applied to two existing Boolean models, namely the human melanogenesis signalling network and the fly segment polarity network. Through mathematical simulations, it was found that these methods successfully identified nodes earlier found to be sensitive using other methods, and were also able to identify sensitive nodes which were previously unreported.