Integrative modelling of the influence of MAPK network on cancer cell fate decision

Metabolic symbiosis between oxygenated and hypoxic tumour cells: An agent-based modelling study

Deregulated metabolism is one of the hallmarks of cancer. It is well-known that tumour cells tend to metabolize glucose via glycolysis even when oxygen is available and mitochondrial respiration is functional. However, the lower energy efficiency of aerobic glycolysis with respect to mitochondrial respiration makes this behaviour, namely the Warburg effect, counter-intuitive, although it has now been recognized as source of anabolic precursors. On the other hand, there is evidence that oxygenated tumour cells could be fuelled by exogenous lactate produced from glycolysis. We employed a multi-scale approach that integrates multi-agent modelling, diffusion-reaction, stoichiometric equations, and Boolean networks to study metabolic cooperation between hypoxic and oxygenated cells exposed to varying oxygen, nutrient, and inhibitor concentrations. The results show that the cooperation reduces the depletion of environmental glucose, resulting in an overall advantage of using aerobic glycolysis. In addition, the oxygen level was found to be decreased by symbiosis, promoting a further shift towards anaerobic glycolysis. However, the oxygenated and hypoxic populations may gradually reach quasi-equilibrium. A sensitivity analysis using Latin hypercube sampling and partial rank correlation shows that the symbiotic dynamics depends on properties of the specific cell such as the minimum glucose level needed for glycolysis. Our results suggest that strategies that block glucose transporters may be more effective to reduce tumour growth than those blocking lactate intake transporters.

In silico designing of multiepitope-based-peptide (MBP) vaccine against MAPK protein express for Alzheimer's disease in Zebrafish

Understanding the role of the mitogen-activated protein kinases (MAPKs) signalling pathway is essential in advancing treatments for neurodegenerative disorders like Alzheimer's. In this study, we investigate in-silico techniques involving computer-based methods to extract the MAPK1 sequence. Our applied methods enable us to analyze the protein's structure, evaluate its properties, establish its evolutionary relationships, and assess its prevalence in populations. We also predict epitopes, assess their ability to trigger immune responses, and check for allergenicity using advanced computational tools to understand their immunological properties comprehensively. We apply virtual screening, docking, and structure modelling to identify promising drug candidates, analyze their interactions, and enhance drug design processes. We identified a total of 30 cell-targeting molecules against the MAPK1 protein, where we selected top 10 CTL epitopes (PAGGGPNPG, GGGPNPGSG, SAPAGGGPN, AVSAPAGGG, AGGGPNPGS, ATAAVSAPA, TAAVSAPAG, ENIIGINDI, INDIIRTPT, and NDIIRTPTI) for further evaluation to determine their potential efficacy, safety, and suitability for vaccine design based on strong binding potential. The potential to cover a large portion of the world's population with these vaccines is substantial-88.5 % for one type and 99.99 % for another. In exploring the molecular docking analyses, we examined a library of compounds from the ZINC database. Among them, we identified twelve compounds with the lowest binding energy. Critical residues in the MAPK1 protein, such as VAL48, LYS63, CYS175, ASP176, LYS160, ALA61, LEU165, TYR45, SER162, ARG33, PRO365, PHE363, ILE40, ASN163, and GLU42, are pivotal for interactions with these compounds. Our result suggests that these compounds could influence the protein's behaviour. Moreover, our docking analyses revealed that the predicted peptides have a strong affinity for the MAPK1 protein. These peptides form stable complexes, indicating their potential as potent inhibitors. This study contributes to the identification of new drug compounds and the screening of their desired properties. These compounds could potentially help reduce the excessive activity of MAPK1, which is linked to Alzheimer's disease.

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.

Reducing Boolean networks with backward equivalence

BACKGROUND

Boolean Networks (BNs) are a popular dynamical model in biology where the state of each component is represented by a variable taking binary values that express, for instance, activation/deactivation or high/low concentrations. Unfortunately, these models suffer from the state space explosion, i.e., there are exponentially many states in the number of BN variables, which hampers their analysis.

RESULTS

We present Boolean Backward Equivalence (BBE), a novel reduction technique for BNs which collapses system variables that, if initialized with same value, maintain matching values in all states. A large-scale validation on 86 models from two online model repositories reveals that BBE is effective, since it is able to reduce more than 90% of the models. Furthermore, on such models we also show that BBE brings notable analysis speed-ups, both in terms of state space generation and steady-state analysis. In several cases, BBE allowed the analysis of models that were originally intractable due to the complexity. On two selected case studies, we show how one can tune the reduction power of BBE using model-specific information to preserve all dynamics of interest, and selectively exclude behavior that does not have biological relevance.

CONCLUSIONS

BBE complements existing reduction methods, preserving properties that other reduction methods fail to reproduce, and vice versa. BBE drops all and only the dynamics, including attractors, originating from states where BBE-equivalent variables have been initialized with different activation values The remaining part of the dynamics is preserved exactly, including the length of the preserved attractors, and their reachability from given initial conditions, without adding any spurious behaviours. Given that BBE is a model-to-model reduction technique, it can be combined with further reduction methods for BNs.

Statistical control of structural networks with limited interventions to minimize cellular phenotypic diversity represented by point attractors

The underlying genetic networks of cells give rise to diverse behaviors known as phenotypes. Control of this cellular phenotypic diversity (CPD) may reveal key targets that govern differentiation during development or drug resistance in cancer. This work establishes an approach to control CPD that encompasses practical constraints, including model limitations, the number of simultaneous control targets, which targets are viable for control, and the granularity of control. Cellular networks are often limited to the structure of interactions, due to the practical difficulty of modeling interaction dynamics. However, these dynamics are essential to CPD. In response, our statistical control approach infers the CPD directly from the structure of a network, by considering an ensemble average function over all possible Boolean dynamics for each node in the network. These ensemble average functions are combined with an acyclic form of the network to infer the number of point attractors. Our approach is applied to several known biological models and shown to outperform existing approaches. Statistical control of CPD offers a new avenue to contend with systemic processes such as differentiation and cancer, despite practical limitations in the field.

Global stabilizing control of large-scale biomolecular regulatory networks

MOTIVATION

Cellular behavior is determined by complex non-linear interactions between numerous intracellular molecules that are often represented by Boolean network models. To achieve a desired cellular behavior with minimal intervention, we need to identify optimal control targets that can drive heterogeneous cellular states to the desired phenotypic cellular state with minimal node intervention. Previous attempts to realize such global stabilization were based solely on either network structure information or simple linear dynamics. Other attempts based on non-linear dynamics are not scalable.

RESULTS

Here, we investigate the underlying relationship between structurally identified control targets and optimal global stabilizing control targets based on non-linear dynamics. We discovered that optimal global stabilizing control targets can be identified by analyzing the dynamics between structurally identified control targets. Utilizing these findings, we developed a scalable global stabilizing control framework using both structural and dynamic information. Our framework narrows down the search space based on strongly connected components and feedback vertex sets then identifies global stabilizing control targets based on the canalization of Boolean network dynamics. We find that the proposed global stabilizing control is superior with respect to the number of control target nodes, scalability, and computational complexity.

AVAILABILITY AND IMPLEMENTATION

We provide a GitHub repository that contains the DCGS framework written in Python as well as biological random Boolean network datasets (https://github.com/sugyun/DCGS).

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Target Control of Asynchronous Boolean Networks

We study the target control of asynchronous Boolean networks, to identify interventions that can drive the dynamics of a given Boolean network from any initial state to the desired target attractor. Based on the application time, the control can be realised with three types of perturbations, including instantaneous, temporary and permanent perturbations. We develop efficient methods to compute the target control for a given target attractor with these three types of perturbations. We compare our methods with the stable motif-based control method on a variety of real-life biological networks to evaluate their performance. We show that our methods scale well for large Boolean networks and they are able to identify a rich set of solutions with a small number of perturbations.

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.

SNAIL driven by a feed forward loop motif promotes TGFβinduced epithelial to mesenchymal transition

Epithelial to Mesenchymal Transition (EMT) plays an important role in tissue regeneration, embryonic development, and cancer metastasis. Several signaling pathways are known to regulate EMT, among which the modulation of TGFβ(Transforming Growth Factor-β) induced EMT is crucial in several cancer types. Several mathematical models were built to explore the role of core regulatory circuit of ZEB/miR-200, SNAIL/miR-34 double negative feedback loops in modulating TGFβinduced EMT. Different emergent behavior including tristability, irreversible switching, existence of hybrid EMT states were inferred though these models. Some studies have explored the role of TGFβreceptor activation, SMADs nucleocytoplasmic shuttling and complex formation. Recent experiments have revealed that MDM2 along with SMAD complex regulates SNAIL expression driven EMT. Encouraged by this, in the present study we developed a mathematical model for p53/MDM2 dependent TGFβinduced EMT regulation. Inclusion of p53 brings in an additional mechanistic perspective in exploring the EM transition. The network formulated comprises a C1FFL moderating SNAIL expression involving MDM2 and SMAD complex, which functions as a noise filter and persistent detector. The C1FFL was also observed to operate as a coincidence detector driving the SNAIL dependent downstream signaling into phenotypic switching decision. Systems modelling and analysis of the devised network, displayed interesting dynamic behavior, systems response to various inputs stimulus, providing a better understanding of p53/MDM2 dependent TGF-βinduced Epithelial to Mesenchymal Transition.

Exploring attractor bifurcations in Boolean networks

Background

Boolean networks (BNs) provide an effective modelling formalism for various complex biochemical phenomena. Their long term behaviour is represented by attractors–subsets of the state space towards which the BN eventually converges. These are then typically linked to different biological phenotypes. Depending on various logical parameters, the structure and quality of attractors can undergo a significant change, known as a bifurcation. We present a methodology for analysing bifurcations in asynchronous parametrised Boolean networks.

Results

In this paper, we propose a computational framework employing advanced symbolic graph algorithms that enable the analysis of large networks with hundreds of Boolean variables. To visualise the results of this analysis, we developed a novel interactive presentation technique based on decision trees, allowing us to quickly uncover parameters crucial to the changes in the attractor landscape. As a whole, the methodology is implemented in our tool AEON. We evaluate the method’s applicability on a complex human cell signalling network describing the activity of type-1 interferons and related molecules interacting with SARS-COV-2 virion. In particular, the analysis focuses on explaining the potential suppressive role of the recently proposed drug molecule GRL0617 on replication of the virus.

Conclusions

The proposed method creates a working analogy to the concept of bifurcation analysis widely used in kinetic modelling to reveal the impact of parameters on the system’s stability. The important feature of our tool is its unique capability to work fast with large-scale networks with a relatively large extent of unknown information. The results obtained in the case study are in agreement with the recent biological findings.

Implementing computational modeling in tissue engineering: where disciplines meet

In recent years, the mathematical and computational sciences have developed novel methodologies and insights that can aid in designing advanced bioreactors, microfluidic set-ups or organ-on-chip devices, in optimizing culture conditions, or predicting long-term behavior of engineered tissues in vivo. In this review, we introduce the concept of computational models and how they can be integrated in an interdisciplinary workflow for Tissue Engineering and Regenerative Medicine (TERM). We specifically aim this review of general concepts and examples at experimental scientists with little or no computational modeling experience. We also describe the contribution of computational models in understanding TERM processes and in advancing the TERM field by providing novel insights.

Patient-specific Boolean models of signalling networks guide personalised treatments

Prostate cancer is the second most occurring cancer in men worldwide. To better understand the mechanisms of tumorigenesis and possible treatment responses, we developed a mathematical model of prostate cancer which considers the major signalling pathways known to be deregulated. We personalised this Boolean model to molecular data to reflect the heterogeneity and specific response to perturbations of cancer patients. A total of 488 prostate samples were used to build patient-specific models and compared to available clinical data. Additionally, eight prostate cell line-specific models were built to validate our approach with dose-response data of several drugs. The effects of single and combined drugs were tested in these models under different growth conditions. We identified 15 actionable points of interventions in one cell line-specific model whose inactivation hinders tumorigenesis. To validate these results, we tested nine small molecule inhibitors of five of those putative targets and found a dose-dependent effect on four of them, notably those targeting HSP90 and PI3K. These results highlight the predictive power of our personalised Boolean models and illustrate how they can be used for precision oncology.

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.

In Silico Logical Modelling to Uncover Cooperative Interactions in Cancer

The multistep development of cancer involves the cooperation between multiple molecular lesions, as well as complex interactions between cancer cells and the surrounding tumour microenvironment. The search for these synergistic interactions using experimental models made tremendous contributions to our understanding of oncogenesis. Yet, these approaches remain labour-intensive and challenging. To tackle such a hurdle, an integrative, multidisciplinary effort is required. In this article, we highlight the use of logical computational models, combined with experimental validations, as an effective approach to identify cooperative mechanisms and therapeutic strategies in the context of cancer biology. In silico models overcome limitations of reductionist approaches by capturing tumour complexity and by generating powerful testable hypotheses. We review representative examples of logical models reported in the literature and their validation. We then provide further analyses of our logical model of Epithelium to Mesenchymal Transition (EMT), searching for additional cooperative interactions involving inputs from the tumour microenvironment and gain of function mutations in NOTCH.

Automated inference of Boolean models from molecular interaction maps using CaSQ

Motivation

Molecular interaction maps have emerged as a meaningful way of representing biological mechanisms in a comprehensive and systematic manner. However, their static nature provides limited insights to the emerging behaviour of the described biological system under different conditions. Computational modelling provides the means to study dynamic properties through in silico simulations and perturbations. We aim to bridge the gap between static and dynamic representations of biological systems with CaSQ, a software tool that infers Boolean rules based on the topology and semantics of molecular interaction maps built with CellDesigner.

Results

We developed CaSQ by defining conversion rules and logical formulas for inferred Boolean models according to the topology and the annotations of the starting molecular interaction maps. We used CaSQ to produce executable files of existing molecular maps that differ in size, complexity and the use of Systems Biology Graphical Notation (SBGN) standards. We also compared, where possible, the manually built logical models corresponding to a molecular map to the ones inferred by CaSQ. The tool is able to process large and complex maps built with CellDesigner (either following SBGN standards or not) and produce Boolean models in a standard output format, Systems Biology Marked Up Language-qualitative (SBML-qual), that can be further analyzed using popular modelling tools. References, annotations and layout of the CellDesigner molecular map are retained in the obtained model, facilitating interoperability and model reusability.

Availability and implementation

The present tool is available online: https://lifeware.inria.fr/∼soliman/post/casq/ and distributed as a Python package under the GNU GPLv3 license. The code can be accessed here: https://gitlab.inria.fr/soliman/casq.

Supplementary information

Supplementary data are available at Bioinformatics online.

Fragile Gene WWOX Guides TFAP2A/TFAP2C-Dependent Actions Against Tumor Progression in Grade II Bladder Cancer

INTRODUCTION

The presence of common fragile sites is associated with no-accidental chromosomal instability which occurs prior to carcinogenesis. The WWOX gene spans the second most active fragile site: FRA16D. Chromosomal breakage at this site is more common in bladder cancer patients who are tobacco smokers which suggests the importance of WWOX gene loss regarding bladder carcinogenesis. Tryptophan domains of WWOX are known to recognize motifs of other proteins such as AP-2α and AP-2γ allowing protein-protein interactions. While the roles of both AP-2 transcription factors are important for bladder carcinogenesis, their nature is different. Based on the literature, AP-2γ appears to be oncogenic, whereas AP-2α mainly exhibits tumor suppressor character. Presumably, the interaction between WWOX and both transcription factors regulates thousands of genes, hence the aim of the present study was to determine WWOX, AP-2α, and AP-2γ function in modulating biological processes of bladder cancer.

METHODS

RT-112 cell line (grade II bladder cancer) was subjected to two stable lentiviral transductions. Overall, this resulted in six variants to investigate distinct WWOX, AP-2α, or AP-2γ function as well as WWOX in collaboration with a particular transcription factor. Cellular models were examined with immunocytochemical staining and in terms of differences in biological processes using assays investigating cell viability, proliferation, apoptosis, adhesion, clonogenicity, migration, activity of metalloproteinases and 3D culture growth.

RESULTS

WWOX overexpression increased apoptosis but decreased cell viability, migration and large spatial colonies. AP-2α overexpression decreased tumor cell viability, migratory potential, matrix metalloproteinase-2 activity and clonogenicity. AP-2γ overexpression decreased matrix metalloproteinase-2 activity but increased wound healing, adhesion, clonogenicity and spatial colony formation. WWOX and AP-2α overexpression induced apoptosis but decreased cell viability, adhesion, matrix metalloproteinase-2 activity, overall number of cultured colonies and migration rate. WWOX and AP-2γ overexpression decreased tumor cell viability, proliferation potential, adhesion, clonogenicity and the ability to create spatial structures, but also increased apoptosis or migration rate.

CONCLUSION

Co-overexpression of WWOX with AP-2α or WWOX with AP-2γ resulted in a net anti-tumor effect. However, considering this research findings and the difference between AP-2α and AP-2γ, we suggest that this similarity is due to a divergent behavior of WWOX.

Boolean Feedforward Neural Network Modeling of Molecular Regulatory Networks for Cellular State Conversion

The molecular regulatory network (MRN) within a cell determines cellular states and transitions between them. Thus, modeling of MRNs is crucial, but this usually requires extensive analysis of time-series measurements, which is extremely difficult to obtain from biological experiments. However, single-cell measurement data such as single-cell RNA-sequencing databases have recently provided a new insight into resolving this problem by ordering thousands of cells in pseudo-time according to their differential gene expressions. Neural network modeling can be employed by using temporal data as learning data. In contrast, Boolean network modeling of MRNs has a growing interest, as it is a parameter-free logical modeling and thereby robust to noisy data while still capturing essential dynamics of biological networks. In this study, we propose a Boolean feedforward neural network (FFN) modeling by combining neural network and Boolean network modeling approach to reconstruct a practical and useful MRN model from large temporal data. Furthermore, analyzing the reconstructed MRN model can enable us to identify control targets for potential cellular state conversion. Here, we show the usefulness of Boolean FFN modeling by demonstrating its applicability through a toy model and biological networks.

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.

A Middle-Out Modeling Strategy to Extend a Colon Cancer Logical Model Improves Drug Synergy Predictions in Epithelial-Derived Cancer Cell Lines

Cancer is a heterogeneous and complex disease and one of the leading causes of death worldwide. The high tumor heterogeneity between individuals affected by the same cancer type is accompanied by distinct molecular and phenotypic tumor profiles and variation in drug treatment response. In silico modeling of cancer as an aberrantly regulated system of interacting signaling molecules provides a basis to enhance our biological understanding of disease progression, and it offers the means to use computer simulations to test and optimize drug therapy designs on particular cancer types and subtypes. This sets the stage for precision medicine: the design of treatments tailored to individuals or groups of patients based on their tumor-specific molecular cancer profiles. Here, we show how a relatively large manually curated logical model can be efficiently enhanced further by including components highlighted by a multi-omics data analysis of data from Consensus Molecular Subtypes covering colorectal cancer. The model expansion was performed in a pathway-centric manner, following a partitioning of the model into functional subsystems, named modules. The resulting approach constitutes a middle-out modeling strategy enabling a data-driven expansion of a model from a generic and intermediate level of molecular detail to a model better covering relevant processes that are affected in specific cancer subtypes, comprising 183 biological entities and 603 interactions between them, partitioned in 25 functional modules of varying size and structure. We tested this model for its ability to correctly predict drug combination synergies, against a dataset of experimentally determined cell growth responses with 18 drugs in all combinations, on eight cancer cell lines. The results indicate that the extended model had an improved accuracy for drug synergy prediction for the majority of the experimentally tested cancer cell lines, although significant improvements of the model's predictive performance are still needed. Our study demonstrates how a tumor-data driven middle-out approach toward refining a logical model of a biological system can further customize a computer model to represent specific cancer cell lines and provide a basis for identifying synergistic effects of drugs targeting specific regulatory proteins. This approach bridges between preclinical cancer model data and clinical patient data and may thereby ultimately be of help to develop patient-specific in silico models that can steer treatment decisions in the clinic.

Computational Verification of Large Logical Models-Application to the Prediction of T Cell Response to Checkpoint Inhibitors

At the crossroad between biology and mathematical modeling, computational systems biology can contribute to a mechanistic understanding of high-level biological phenomenon. But as knowledge accumulates, the size and complexity of mathematical models increase, calling for the development of efficient dynamical analysis methods. Here, we propose the use of two approaches for the development and analysis of complex cellular network models. A first approach, called "model verification" and inspired by unitary testing in software development, enables the formalization and automated verification of validation criteria for whole models or selected sub-parts. When combined with efficient analysis methods, this approach is suitable for continuous testing, thereby greatly facilitating model development. A second approach, called "value propagation," enables efficient analytical computation of the impact of specific environmental or genetic conditions on the dynamical behavior of some models. We apply these two approaches to the delineation and the analysis of a comprehensive model for T cell activation, taking into account CTLA4 and PD-1 checkpoint inhibitory pathways. While model verification greatly eases the delineation of logical rules complying with a set of dynamical specifications, propagation provides interesting insights into the different potential of CTLA4 and PD-1 immunotherapies. Both methods are implemented and made available in the all-inclusive CoLoMoTo Docker image, while the different steps of the model analysis are fully reported in two companion interactive jupyter notebooks, thereby ensuring the reproduction of our results.

Basins of Attraction, Commitment Sets, and Phenotypes of Boolean Networks

The attractors of Boolean networks and their basins have been shown to be highly relevant for model validation and predictive modeling, e.g., in systems biology. Yet, there are currently very few tools available that are able to compute and visualize not only attractors but also their basins. In the realm of asynchronous, non-deterministic modeling not only is the repertoire of software even more limited, but also the formal notions for basins of attraction are often lacking. In this setting, the difficulty both for theory and computation arises from the fact that states may be elements of several distinct basins. In this paper, we address this topic by partitioning the state space into sets that are committed to the same attractors. These commitment sets can easily be generalized to sets that are equivalent w.r.t. the long-term behaviors of pre-selected nodes which leads us to the notions of markers and phenotypes which we illustrate in a case study on bladder tumorigenesis. For every concept, we propose equivalent CTL model checking queries and an extension of the state of the art model checking software NuSMV is made available that is capable of computing the respective sets. All notions are fully integrated as three new modules in our Python package PyBoolNet, including functions for visualizing the basins, commitment sets, and phenotypes as quotient graphs and pie charts.

Conceptual and computational framework for logical modelling of biological networks deregulated in diseases

Mathematical models can serve as a tool to formalize biological knowledge from diverse sources, to investigate biological questions in a formal way, to test experimental hypotheses, to predict the effect of perturbations and to identify underlying mechanisms. We present a pipeline of computational tools that performs a series of analyses to explore a logical model's properties. A logical model of initiation of the metastatic process in cancer is used as a transversal example. We start by analysing the structure of the interaction network constructed from the literature or existing databases. Next, we show how to translate this network into a mathematical object, specifically a logical model, and how robustness analyses can be applied to it. We explore the visualization of the stable states, defined as specific attractors of the model, and match them to cellular fates or biological read-outs. With the different tools we present here, we explain how to assign to each solution of the model a probability and how to identify genetic interactions using mutant phenotype probabilities. Finally, we connect the model to relevant experimental data: we present how some data analyses can direct the construction of the network, and how the solutions of a mathematical model can also be compared with experimental data, with a particular focus on high-throughput data in cancer biology. A step-by-step tutorial is provided as a Supplementary Material and all models, tools and scripts are provided on an accompanying website: https://github.com/sysbio-curie/Logical_modelling_pipeline.

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.

Patient-specific logic models of signaling pathways from screenings on cancer biopsies to prioritize personalized combination therapies

Mechanistic modeling of signaling pathways mediating patient-specific response to therapy can help to unveil resistance mechanisms and improve therapeutic strategies. Yet, creating such models for patients, in particular for solid malignancies, is challenging. A major hurdle to build these models is the limited material available that precludes the generation of large-scale perturbation data. Here, we present an approach that couples ex vivo high-throughput screenings of cancer biopsies using microfluidics with logic-based modeling to generate patient-specific dynamic models of extrinsic and intrinsic apoptosis signaling pathways. We used the resulting models to investigate heterogeneity in pancreatic cancer patients, showing dissimilarities especially in the PI3K-Akt pathway. Variation in model parameters reflected well the different tumor stages. Finally, we used our dynamic models to efficaciously predict new personalized combinatorial treatments. Our results suggest that our combination of microfluidic experiments and mathematical model can be a novel tool toward cancer precision medicine.

A Robustness Analysis of Dynamic Boolean Models of Cellular Circuits

With ever growing amounts of omics data, the next challenge in biological research is the interpretation of these data to gain mechanistic insights about cellular function. Dynamic models of cellular circuits that capture the activity levels of proteins and other molecules over time offer great expressive power by allowing the simulation of the effects of specific internal or external perturbations on the workings of the cell. However, the study of such models is at its infancy and no large-scale analysis of the robustness of real models to changing conditions has been conducted to date. Here we provide a computational framework to study the robustness of such models using a combination of stochastic simulations and integer linear programming techniques. We apply our framework to a large collection of cellular circuits and benchmark the results against randomized models. We find that the steady states of real circuits tend to be more robust in multiple aspects compared with their randomized counterparts.

RA-map: building a state-of-the-art interactive knowledge base for rheumatoid arthritis

Rheumatoid arthritis (RA) is a progressive, inflammatory autoimmune disease of unknown aetiology. The complex mechanism of aetiopathogenesis, progress and chronicity of the disease involves genetic, epigenetic and environmental factors. To understand the molecular mechanisms underlying disease phenotypes, one has to place implicated factors in their functional context. However, integration and organization of such data in a systematic manner remains a challenging task. Molecular maps are widely used in biology to provide a useful and intuitive way of depicting a variety of biological processes and disease mechanisms. Recent large-scale collaborative efforts such as the Disease Maps Project demonstrate the utility of such maps as versatile tools to organize and formalize disease-specific knowledge in a comprehensive way, both human and machine-readable. We present a systematic effort to construct a fully annotated, expert validated, state-of-the-art knowledge base for RA in the form of a molecular map. The RA map illustrates molecular and signalling pathways implicated in the disease. Signal transduction is depicted from receptors to the nucleus using the Systems Biology Graphical Notation (SBGN) standard representation. High-quality manual curation, use of only human-specific studies and focus on small-scale experiments aim to limit false positives in the map. The state-of-the-art molecular map for RA, using information from 353 peer-reviewed scientific publications, comprises 506 species, 446 reactions and 8 phenotypes. The species in the map are classified to 303 proteins, 61 complexes, 106 genes, 106 RNA entities, 2 ions and 7 simple molecules. The RA map is available online at ramap.elixir-luxembourg.org as an open-access knowledge base allowing for easy navigation and search of molecular pathways implicated in the disease. Furthermore, the RA map can serve as a template for omics data visualization.

A feedback loop of conditionally stable circuits drives the cell cycle from checkpoint to checkpoint

We perform logic-based network analysis on a model of the mammalian cell cycle. This model is composed of a Restriction Switch driving cell cycle commitment and a Phase Switch driving mitotic entry and exit. By generalizing the concept of stable motif, i.e., a self-sustaining positive feedback loop that maintains an associated state, we introduce the concept of a conditionally stable motif, the stability of which is contingent on external conditions. We show that the stable motifs of the Phase Switch are contingent on the state of three nodes through which it receives input from the rest of the network. Biologically, these conditions correspond to cell cycle checkpoints. Holding these nodes locked (akin to a checkpoint-free cell) transforms the Phase Switch into an autonomous oscillator that robustly toggles through the cell cycle phases G1, G2 and mitosis. The conditionally stable motifs of the Phase Switch Oscillator are organized into an ordered sequence, such that they serially stabilize each other but also cause their own destabilization. Along the way they channel the dynamics of the module onto a narrow path in state space, lending robustness to the oscillation. Self-destabilizing conditionally stable motifs suggest a general negative feedback mechanism leading to sustained oscillations.

A multiscale signalling network map of innate immune response in cancer reveals cell heterogeneity signatures

The lack of integrated resources depicting the complexity of the innate immune response in cancer represents a bottleneck for high-throughput data interpretation. To address this challenge, we perform a systematic manual literature mining of molecular mechanisms governing the innate immune response in cancer and represent it as a signalling network map. The cell-type specific signalling maps of macrophages, dendritic cells, myeloid-derived suppressor cells and natural killers are constructed and integrated into a comprehensive meta map of the innate immune response in cancer. The meta-map contains 1466 chemical species as nodes connected by 1084 biochemical reactions, and it is supported by information from 820 articles. The resource helps to interpret single cell RNA-Seq data from macrophages and natural killer cells in metastatic melanoma that reveal different anti- or pro-tumor sub-populations within each cell type. Here, we report a new open source analytic platform that supports data visualisation and interpretation of tumour microenvironment activity in cancer.

The complexity of the innate immune response to cancer makes interpretation of large data sets challenging. Here, the authors provide an integrated multi-scale map of signalling networks representing the different immune cells and their interactions and show its utility for data interpretation.

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.

Controlling large Boolean networks with single-step perturbations

Motivation

The control of Boolean networks has traditionally focussed on strategies where the perturbations are applied to the nodes of the network for an extended period of time. In this work, we study if and how a Boolean network can be controlled by perturbing a minimal set of nodes for a single-step and letting the system evolve afterwards according to its original dynamics. More precisely, given a Boolean network (BN), we compute a minimal subset Cmin of the nodes such that BN can be driven from any initial state in an attractor to another ‘desired’ attractor by perturbing some or all of the nodes of Cmin for a single-step. Such kind of control is attractive for biological systems because they are less time consuming than the traditional strategies for control while also being financially more viable. However, due to the phenomenon of state-space explosion, computing such a minimal subset is computationally inefficient and an approach that deals with the entire network in one-go, does not scale well for large networks.

Results

We develop a ‘divide-and-conquer’ approach by decomposing the network into smaller partitions, computing the minimal control on the projection of the attractors to these partitions and then composing the results to obtain Cmin for the whole network. We implement our method and test it on various real-life biological networks to demonstrate its applicability and efficiency.

Supplementary information

Supplementary data are available at Bioinformatics online.

Glucocorticoid Receptor Modulates EGFR Feedback upon Acquisition of Resistance to Monoclonal Antibodies

Evidences of a crosstalk between Epidermal Growth Factor Receptor (EGFR) and Glucocorticoid Receptor (GR) has been reported, ranging from the modulation of receptor levels or GR mediated transcriptional repression of EGFR target genes, with modifications of epigenetic markers. The present study focuses on the involvement of EGFR positive and negative feedback genes in the establishment of cetuximab (CTX) resistance in metastatic Colorectal Cancer (CRC) patients. We evaluated the expression profile of the EGFR ligands TGFA and HBEGF, along with the pro-inflammatory cytokines IL-1B and IL-8, which were previously reported to be negatively associated with monoclonal antibody response, both in mice and patient specimens. Among EGFR negative feedback loops, we focused on ERRFI1, DUSP1, LRIG3, and LRIG1. We observed that EGFR positive feedback genes are increased in CTX-resistant cells, whereas negative feedback genes are reduced. Next, we tested the expression of these genes in CTX-resistant cells upon GR modulation. We unveiled that GR activation leads to an increase in ERRFI1, DUSP1, and LRIG1, which were shown to restrict EGFR activity, along with a decrease in the EGFR activators (TGFA and IL-8). Finally, in a cohort of xenopatients, stratified for response to cetuximab, we observed an inverse association between the expression level of LRIG1 and CRC progression upon CTX treatment. Our model implies that combining GR modulation to EGFR inhibition may yield an effective treatment strategy in halting cancer progression.

Cooperation between T cell receptor and Toll-like receptor 5 signaling for CD4+ T cell activation

CD4⁺ T cells recognize antigens through their T cell receptors (TCRs); however, additional signals involving costimulatory receptors, for example, CD28, are required for proper T cell activation. Alternative costimulatory receptors have been proposed, including members of the Toll-like receptor (TLR) family, such as TLR5 and TLR2. To understand the molecular mechanism underlying a potential costimulatory role for TLR5, we generated detailed molecular maps and logical models for the TCR and TLR5 signaling pathways and a merged model for cross-interactions between the two pathways. Furthermore, we validated the resulting model by analyzing how T cells responded to the activation of these pathways alone or in combination, in terms of the activation of the transcriptional regulators CREB, AP-1 (c-Jun), and NF-κB (p65). Our merged model accurately predicted the experimental results, showing that the activation of TLR5 can play a similar role to that of CD28 activation with respect to AP-1, CREB, and NF-κB activation, thereby providing insights regarding the cross-regulation of these pathways in CD4⁺ T cells.

Community-driven roadmap for integrated disease maps

The Disease Maps Project builds on a network of scientific and clinical groups that exchange best practices, share information and develop systems biomedicine tools. The project aims for an integrated, highly curated and user-friendly platform for disease-related knowledge. The primary focus of disease maps is on interconnected signaling, metabolic and gene regulatory network pathways represented in standard formats. The involvement of domain experts ensures that the key disease hallmarks are covered and relevant, up-to-date knowledge is adequately represented. Expert-curated and computer readable, disease maps may serve as a compendium of knowledge, allow for data-supported hypothesis generation or serve as a scaffold for the generation of predictive mathematical models. This article summarizes the 2nd Disease Maps Community meeting, highlighting its important topics and outcomes. We outline milestones on the roadmap for the future development of disease maps, including creating and maintaining standardized disease maps; sharing parts of maps that encode common human disease mechanisms; providing technical solutions for complexity management of maps; and Web tools for in-depth exploration of such maps. A dedicated discussion was focused on mathematical modeling approaches, as one of the main goals of disease map development is the generation of mathematically interpretable representations to predict disease comorbidity or drug response and to suggest drug repositioning, altogether supporting clinical decisions.

Boolean model of growth signaling, cell cycle and apoptosis predicts the molecular mechanism of aberrant cell cycle progression driven by hyperactive PI3K

The PI3K/AKT signaling pathway plays a role in most cellular functions linked to cancer progression, including cell growth, proliferation, cell survival, tissue invasion and angiogenesis. It is generally recognized that hyperactive PI3K/AKT1 are oncogenic due to their boost to cell survival, cell cycle entry and growth-promoting metabolism. That said, the dynamics of PI3K and AKT1 during cell cycle progression are highly nonlinear. In addition to negative feedback that curtails their activity, protein expression of PI3K subunits has been shown to oscillate in dividing cells. The low-PI3K/low-AKT1 phase of these oscillations is required for cytokinesis, indicating that oncogenic PI3K may directly contribute to genome duplication. To explore this, we construct a Boolean model of growth factor signaling that can reproduce PI3K oscillations and link them to cell cycle progression and apoptosis. The resulting modular model reproduces hyperactive PI3K-driven cytokinesis failure and genome duplication and predicts the molecular drivers responsible for these failures by linking hyperactive PI3K to mis-regulation of Polo-like kinase 1 (Plk1) expression late in G2. To do this, our model captures the role of Plk1 in cell cycle progression and accurately reproduces multiple effects of its loss: G2 arrest, mitotic catastrophe, chromosome mis-segregation / aneuploidy due to premature anaphase, and cytokinesis failure leading to genome duplication, depending on the timing of Plk1 inhibition along the cell cycle. Finally, we offer testable predictions on the molecular drivers of PI3K oscillations, the timing of these oscillations with respect to division, and the role of altered Plk1 and FoxO activity in genome-level defects caused by hyperactive PI3K. Our model is an important starting point for the predictive modeling of cell fate decisions that include AKT1-driven senescence, as well as the non-intuitive effects of drugs that interfere with mitosis.

Modeling genotypes in their microenvironment to predict single- and multi-cellular behavior

A cell's phenotype is the set of observable characteristics resulting from the interaction of the genotype with the surrounding environment, determining cell behavior. Deciphering genotype-phenotype relationships has been crucial to understanding normal and disease biology. Analysis of molecular pathways has provided an invaluable tool to such understanding; however, typically it does not consider the physical microenvironment, which is a key determinant of phenotype. In this study, we present a novel modeling framework that enables the study of the link between genotype, signaling networks, and cell behavior in a three-dimensional microenvironment. To achieve this, we bring together Agent-Based Modeling, a powerful computational modeling technique, and gene networks. This combination allows biological hypotheses to be tested in a controlled stepwise fashion, and it lends itself naturally to model a heterogeneous population of cells acting and evolving in a dynamic microenvironment, which is needed to predict the evolution of complex multi-cellular dynamics. Importantly, this enables modeling co-occurring intrinsic perturbations, such as mutations, and extrinsic perturbations, such as nutrient availability, and their interactions. Using cancer as a model system, we illustrate how this framework delivers a unique opportunity to identify determinants of single-cell behavior, while uncovering emerging properties of multi-cellular growth. This framework is freely available at http://www.microc.org.

Personalization of Logical Models With Multi-Omics Data Allows Clinical Stratification of Patients

Logical models of cancer pathways are typically built by mining the literature for relevant experimental observations. They are usually generic as they apply for large cohorts of individuals. As a consequence, they generally do not capture the heterogeneity of patient tumors and their therapeutic responses. We present here a novel framework, referred to as PROFILE, to tailor logical models to a particular biological sample such as a patient tumor. This methodology permits to compare the model simulations to individual clinical data, i.e., survival time. Our approach focuses on integrating mutation data, copy number alterations (CNA), and expression data (transcriptomics or proteomics) to logical models. These data need first to be either binarized or set between 0 and 1, and can then be incorporated in the logical model by modifying the activity of the node, the initial conditions or the state transition rates. The use of MaBoSS, a tool based on Monte-Carlo kinetic algorithm to perform stochastic simulations on logical models results in model state probabilities, and allows for a semi-quantitative study of the model phenotypes and perturbations. As a proof of concept, we use a published generic model of cancer signaling pathways and molecular data from METABRIC breast cancer patients. For this example, we test several combinations of data incorporation and discuss that, with these data, the most comprehensive patient-specific cancer models are obtained by modifying the nodes' activity of the model with mutations, in combination or not with CNA data, and altering the transition rates with RNA expression. We conclude that these model simulations show good correlation with clinical data such as patients' Nottingham prognostic index (NPI) subgrouping and survival time. We observe that two highly relevant cancer phenotypes derived from personalized models, Proliferation and Apoptosis, are biologically consistent prognostic factors: patients with both high proliferation and low apoptosis have the worst survival rate, and conversely. Our approach aims to combine the mechanistic insights of logical modeling with multi-omics data integration to provide patient-relevant models. This work leads to the use of logical modeling for precision medicine and will eventually facilitate the choice of patient-specific drug treatments by physicians.

Taming Asynchrony for Attractor Detection in Large Boolean Networks

Boolean networks is a well-established formalism for modelling biological systems. A vital challenge for analyzing a Boolean network is to identify all the attractors. This becomes more challenging for large asynchronous Boolean networks, due to the asynchronous scheme. Existing methods are prohibited due to the well-known state-space explosion problem in large Boolean networks. In this paper, we tackle this challenge by proposing a SCC-based decomposition method. We prove the correctness of our proposed method and demonstrate its efficiency with two real-life biological networks.

Non-Coding RNAs in Glioma

Glioma is the most aggressive brain tumor of the central nervous system. The ability of glioma cells to migrate, rapidly diffuse and invade normal adjacent tissue, their sustained proliferation, and heterogeneity contribute to an overall survival of approximately 15 months for most patients with high grade glioma. Numerous studies indicate that non-coding RNA species have critical functions across biological processes that regulate glioma initiation and progression. Recently, new data emerged, which shows that the cross-regulation between long non-coding RNAs and small non-coding RNAs contribute to phenotypic diversity of glioblastoma subclasses. In this paper, we review data of long non-coding RNA expression, which was evaluated in human glioma tissue samples during a five-year period. Thus, this review summarizes the following: (I) the role of non-coding RNAs in glioblastoma pathogenesis, (II) the potential application of non-coding RNA species in glioma-grading, (III) crosstalk between lncRNAs and miRNAs (IV) future perspectives of non-coding RNAs as biomarkers for glioma.

Evaluating Uncertainty in Signaling Networks Using Logical Modeling

Systems biology studies the structure and dynamics of biological systems using mathematical approaches. Bottom-up approaches create models from prior knowledge but usually cannot cope with uncertainty, whereas top-down approaches infer models directly from data using statistical methods but mostly neglect valuable known information from former studies. Here, we want to present a workflow that includes prior knowledge while allowing for uncertainty in the modeling process. We build not one but all possible models that arise from the uncertainty using logical modeling and subsequently filter for those models in agreement with data in a top-down manner. This approach enables us to investigate new and more complex biological research questions, however, the encoding in such a framework is often not obvious and thus not easily accessible for researcher from life sciences. To mitigate this problem, we formulate a pipeline with specific templates to address some research questions common in signaling network analysis. To illustrate the potential of this approach, we applied the pipeline to growth factor signaling processes in two renal cancer cell lines. These two cell lines originate from similar tissue, but surprisingly showed a very different behavior toward the cancer drug Sorafenib. Thus our aim was to explore differences between these cell lines regarding three sources of uncertainty in one analysis: possible targets of Sorafenib, crosstalk between involved pathways, and the effect of a mutation in mammalian target of Rapamycin (mTOR) in one of the cell lines. We were able to show that the model pools from the cell lines are disjoint, thus the discrepancies in behavior originate from differences in the cellular wiring. Also the mutation in mTOR is not affecting its activity in the pathway. The results on Sorafenib, while not fully clarifying the mechanisms involved, illustrate the potential of this analysis for generating new hypotheses.

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.

Determining Relative Dynamic Stability of Cell States Using Boolean Network Model

Cell state transition is at the core of biological processes in metazoan, which includes cell differentiation, epithelial-to-mesenchymal transition (EMT) and cell reprogramming. In these cases, it is important to understand the molecular mechanism of cellular stability and how the transitions happen between different cell states, which is controlled by a gene regulatory network (GRN) hard-wired in the genome. Here we use Boolean modeling of GRN to study the cell state transition of EMT and systematically compare four available methods to calculate the cellular stability of three cell states in EMT in both normal and genetically mutated cases. The results produced from four methods generally agree but do not totally agree with each other. We show that distribution of one-degree neighborhood of cell states, which are the nearest states by Hamming distance, causes the difference among the methods. From that, we propose a new method based on one-degree neighborhood, which is the simplest one and agrees with other methods to estimate the cellular stability in all scenarios of our EMT model. This new method will help the researchers in the field of cell differentiation and cell reprogramming to calculate cellular stability using Boolean model, and then rationally design their experimental protocols to manipulate the cell state transition.

Global Stabilization of Boolean Networks to Control the Heterogeneity of Cellular Responses

Boolean networks (BNs) have been widely used as a useful model for molecular regulatory networks in systems biology. In the state space of BNs, attractors represent particular cell phenotypes. For targeted therapy of cancer, there is a pressing need to control the heterogeneity of cellular responses to the targeted drug by reducing the number of attractors associated with the ill phenotypes of cancer cells. Here, we present a novel control scheme for global stabilization of BNs to a unique fixed point. Using a sufficient condition of global stabilization with respect to the adjacency matrix, we can determine a set of constant controls so that the controlled BN is steered toward an unspecified fixed point which can then be further transformed to a desired attractor by subsequent control. Our method is efficient in that it has polynomial complexity with respect to the number of state variables, while having exponential complexity with respect to in-degree of BNs. To demonstrate the applicability of the proposed control scheme, we conduct simulation studies using a regulation influence network describing the metastatic process of cells and the Mitogen-activated protein kinase (MAPK) signaling network that is crucial in cancer cell fate determination.

Influence Networks Compared with Reaction Networks: Semantics, Expressivity and Attractors

Biochemical reaction networks are one of the most widely used formalisms in systems biology to describe the molecular mechanisms of high-level cell processes. However, modellers also reason with influence diagrams to represent the positive and negative influences between molecular species and may find an influence network useful in the process of building a reaction network. In this paper, we introduce a formalism of influence networks with forces, and equip it with a hierarchy of Boolean, Petri net, stochastic and differential semantics, similarly to reaction networks with rates. We show that the expressive power of influence networks is the same as that of reaction networks under the differential semantics, but weaker under the discrete semantics. Furthermore, the hierarchy of semantics leads us to consider a (positive) Boolean semantics that cannot test the absence of a species, that we compare with the (negative) Boolean semantics with test for absence of a species in gene regulatory networks à la Thomas. We study the monotonicity properties of the positive semantics and derive from them an algorithm to compute attractors in both the positive and negative Boolean semantics. We illustrate our results on models of the literature about the p53/Mdm2 DNA damage repair system, the circadian clock, and the influence of MAPK signaling on cell-fate decision in urinary bladder cancer.

Reduction of Qualitative Models of Biological Networks for Transient Dynamics Analysis

Qualitative models of dynamics of signalling pathways and gene regulatory networks allow for the capturing of temporal properties of biological networks while requiring few parameters. However, these discrete models typically suffer from the so-called state space explosion problem which makes the formal assessment of their potential behaviors very challenging. In this paper, we describe a method to reduce a qualitative model for enhancing the tractability of analysis of transient reachability properties. The reduction does not change the dimension of the model, but instead limits its degree of freedom, therefore reducing the set of states and transitions to consider. We rely on a transition-centered specification of qualitative models by the mean of automata networks. Our framework encompasses the usual asynchronous Boolean and multi-valued network, as well as 1-bounded Petri nets. Applied to different large-scale biological networks from the litterature, we show that the reduction can lead to a drastic improvement for the scalability of verification methods.

Logical Modeling and Analysis of Cellular Regulatory Networks With GINsim 3.0

The logical formalism is well adapted to model large cellular networks, in particular when detailed kinetic data are scarce. This tutorial focuses on this well-established qualitative framework. Relying on GINsim (release 3.0), a software implementing this formalism, we guide the reader step by step toward the definition, the analysis and the simulation of a four-node model of the mammalian p53-Mdm2 network.

P_UNSAT approach of attractor calculation for Boolean gene regulatory networks

Boolean network models provide an efficient way for studying gene regulatory networks. The main dynamics of a Boolean network is determined by its attractors. Attractor calculation plays a key role for analyzing Boolean gene regulatory networks. An approach of attractor calculation was proposed in this study, which combined the predecessor approach and the logic unsatisfiability approach to accelerate attractor calculation. The proposed algorithm is effective to calculate all attractors for large-scale Boolean gene regulatory networks even the networks with a relatively large average degree.

Discrete dynamic network modeling of oncogenic signaling: Mechanistic insights for personalized treatment of cancer

Targeted drugs disrupting proteins that are dysregulated in cancer have emerged as promising treatments because of their specificity to cancer cell aberrations and thus their improved side effect profile. However, their success remains limited, largely due to existing or emergent therapy resistance. We suggest that this is due to limited understanding of the entire relevant cellular landscape. A class of mathematical models called discrete dynamic network models can be used to understand the integrated effect of an individual tumor's aberrations. We review the recent literature on discrete dynamic models of cancer and highlight their predicted therapeutic strategies. We believe dynamic network modeling can be used to drive treatment decision-making in a personalized manner to direct improved treatments in cancer.

•

Cancer is rooted in incorrect cellular decisions caused by genetic alterations.

•

Dynamic models of signaling networks can map the relevant repertoire of alterations.

•

Discrete dynamic network models can predict therapeutic interventions.

•

Progress in personalized medicine needs integration of multiple data and model types.

Target Control in Logical Models Using the Domain of Influence of Nodes

Dynamical models of biomolecular networks are successfully used to understand the mechanisms underlying complex diseases and to design therapeutic strategies. Network control and its special case of target control, is a promising avenue toward developing disease therapies. In target control it is assumed that a small subset of nodes is most relevant to the system's state and the goal is to drive the target nodes into their desired states. An example of target control would be driving a cell to commit to apoptosis (programmed cell death). From the experimental perspective, gene knockout, pharmacological inhibition of proteins, and providing sustained external signals are among practical intervention techniques. We identify methodologies to use the stabilizing effect of sustained interventions for target control in Boolean network models of biomolecular networks. Specifically, we define the domain of influence (DOI) of a node (in a certain state) to be the nodes (and their corresponding states) that will be ultimately stabilized by the sustained state of this node regardless of the initial state of the system. We also define the related concept of the logical domain of influence (LDOI) of a node, and develop an algorithm for its identification using an auxiliary network that incorporates the regulatory logic. This way a solution to the target control problem is a set of nodes whose DOI can cover the desired target node states. We perform greedy randomized adaptive search in node state space to find such solutions. We apply our strategy to in silico biological network models of real systems to demonstrate its effectiveness.