Efficient modeling, simulation and coarse-graining of biological complexity with NFsim

bnglViz: online visualization of rule-based models

MOTIVATION

Rule-based modeling is a powerful method to describe and simulate interactions among multi-site molecules and multi-molecular species, accounting for the internal connectivity of molecules in chemical species. This modeling technique is implemented in BioNetGen software that is used by various tools and software frameworks, such as BioNetGen stand-alone software, NFSim simulation engine, Virtual Cell simulation and modeling framework, SmolDyn and PySB software tools. These tools exchange models using BioNetGen scripting language (BNGL). Until now, there was no online visualization of such rule-based models. Modelers and researchers reading the manuscripts describing rule-based models had to learn BNGL scripting or master one of these tools to understand the models.

RESULTS

Here, we introduce bnglViz, an online platform for visualizing BNGL files as graphical cartoons, empowering researchers to grasp the nuances of rule-based models swiftly and efficiently, and making the exploration of complex biological systems more accessible than ever before. The produced visualizations can be used as supplemental figures in publications or as a way to annotate BNGL models on web repositories.

AVAILABILITY AND IMPLEMENTATION

Available at https://bnglviz.github.io/.

MCell4 with BioNetGen: A Monte Carlo simulator of rule-based reaction-diffusion systems with Python interface

Biochemical signaling pathways in living cells are often highly organized into spatially segregated volumes, membranes, scaffolds, subcellular compartments, and organelles comprising small numbers of interacting molecules. At this level of granularity stochastic behavior dominates, well-mixed continuum approximations based on concentrations break down and a particle-based approach is more accurate and more efficient. We describe and validate a new version of the open-source MCell simulation program (MCell4), which supports generalized 3D Monte Carlo modeling of diffusion and chemical reaction of discrete molecules and macromolecular complexes in solution, on surfaces representing membranes, and combinations thereof. The main improvements in MCell4 compared to the previous versions, MCell3 and MCell3-R, include a Python interface and native BioNetGen reaction language (BNGL) support. MCell4's Python interface opens up completely new possibilities for interfacing with external simulators to allow creation of sophisticated event-driven multiscale/multiphysics simulations. The native BNGL support, implemented through a new open-source library libBNG (also introduced in this paper), provides the capability to run a given BNGL model spatially resolved in MCell4 and, with appropriate simplifying assumptions, also in the BioNetGen simulation environment, greatly accelerating and simplifying model validation and comparison.

A spatial model of autophosphorylation of CaMKII in a glutamatergic spine suggests a network-driven kinetic mechanism for bistable changes in synaptic strength

Activation of N-methyl-D-aspartate-type glutamate receptors (NMDARs) at synapses in the CNS triggers changes in synaptic strength that underlie memory formation in response to strong synaptic stimuli. The primary target of Ca2+ flowing through NMDARs is Ca2+/calmodulin-dependent protein kinase II (CaMKII) which forms dodecameric holoenzymes that are highly concentrated at the postsynaptic site. Activation of CaMKII is necessary to trigger long-term potentiation of synaptic strength (LTP), and is prolonged by autophosphorylation of subunits within the holoenzyme. Here we use MCell4, an agent-based, stochastic, modeling platform to model CaMKII holoenzymes placed within a realistic spine geometry. We show how two mechanisms of regulation of CaMKII, 'Ca2+-calmodulin-trapping (CaM-trapping)' and dephosphorylation by protein phosphatase-1 (PP1) shape the autophosphorylation response during a repeated high-frequency stimulus. Our simulation results suggest that autophosphorylation of CaMKII does not constitute a bistable switch. Instead, prolonged but temporary, autophosphorylation of CaMKII may contribute to a biochemical-network-based 'kinetic proof-reading" mechanism that controls induction of synaptic plasticity.

A query-response causal analysis of reaction events in biochemical reaction networks

The stochastic kinetics of biochemical reaction networks is described by a chemical master equation (CME) and the underlying laws of mass action. Assuming network-free simulations of the rule-based models of biochemical reaction networks (BRNs), this paper departs from the usual analysis of network dynamics as the time-dependent distributions of chemical species counts, and instead considers statistically evaluating the sequences of reaction events generated from the stochastic simulations. The reaction event-time series can be used for reaction clustering, identifying rare events, and recognizing the periods of increased or steady-state activity. However, the main aim of this paper is to device an effective method for identifying causally and anti-causally related sub-sequences of reaction events using their empirical probabilities. This allows discovering some of the causal dynamics of BRNs as well as uncovering their short-term deterministic behaviors. In particular, it is proposed that the reaction sub-sequences that are conditionally nearly certain or nearly uncertain can be considered as being causally related. Moreover, since the time-ordering of reaction events is locally irrelevant, the reaction sub-sequences can be transformed into the reaction sets or multi-sets. The distance metrics can be then used to define the equivalences among the reaction events. The proposed method for identifying the causally related reaction sub-sequences has been implemented as a computationally efficient query-response mechanism. The method was evaluated for five models of genetic networks in seven defined numerical experiments. The models were simulated in BioNetGen using the open-source network-free simulator NFsim. This simulator had to be modified first to allow recording the traces of reaction events, and it is available in the Github repository, ploskot/nfsim_1.20. The generated event time-series were analyzed with Python and Matlab scripts. The whole process of data generation, analysis and visualization has been nearly fully automated using shell scripts. This demonstrates the opportunities for substantially increasing the research productivity by creating automated data generation and processing pipelines.

BioNetGMMFit: estimating parameters of a BioNetGen model from time-stamped snapshots of single cells

Mechanistic models are commonly employed to describe signaling and gene regulatory kinetics in single cells and cell populations. Recent advances in single-cell technologies have produced multidimensional datasets where snapshots of copy numbers (or abundances) of a large number of proteins and mRNA are measured across time in single cells. The availability of such datasets presents an attractive scenario where mechanistic models are validated against experiments, and estimated model parameters enable quantitative predictions of signaling or gene regulatory kinetics. To empower the systems biology community to easily estimate parameters accurately from multidimensional single-cell data, we have merged a widely used rule-based modeling software package BioNetGen, which provides a user-friendly way to code for mechanistic models describing biochemical reactions, and the recently introduced CyGMM, that uses cell-to-cell differences to improve parameter estimation for such networks, into a single software package: BioNetGMMFit. BioNetGMMFit provides parameter estimates of the model, supplied by the user in the BioNetGen markup language (BNGL), which yield the best fit for the observed single-cell, time-stamped data of cellular components. Furthermore, for more precise estimates, our software generates confidence intervals around each model parameter. BioNetGMMFit is capable of fitting datasets of increasing cell population sizes for any mechanistic model specified in the BioNetGen markup language. By streamlining the process of developing mechanistic models for large single-cell datasets, BioNetGMMFit provides an easily-accessible modeling framework designed for scale and the broader biochemical signaling community.

kboolnet: a toolkit for the verification, validation, and visualization of reaction-contingency (rxncon) models

BACKGROUND

Computational models of cell signaling networks are extremely useful tools for the exploration of underlying system behavior and prediction of response to various perturbations. By representing signaling cascades as executable Boolean networks, the previously developed rxncon ("reaction-contingency") formalism and associated Python package enable accurate and scalable modeling of signal transduction even in large (thousands of components) biological systems. The models are split into reactions, which generate states, and contingencies, that impinge on reactions; this avoids the so-called "combinatorial explosion" of system size. Boolean description of the biological system compensates for the poor availability of kinetic parameters which are necessary for quantitative models. Unfortunately, few tools are available to support rxncon model development, especially for large, intricate systems.

RESULTS

We present the kboolnet toolkit ( https://github.com/Kufalab-UCSD/kboolnet , complete documentation at https://github.com/Kufalab-UCSD/kboolnet/wiki ), an R package and a set of scripts that seamlessly integrate with the python-based rxncon software and collectively provide a complete workflow for the verification, validation, and visualization of rxncon models. The verification script VerifyModel.R checks for responsiveness to repeated stimulations as well as consistency of steady state behavior. The validation scripts TruthTable.R, SensitivityAnalysis.R, and ScoreNet.R provide various readouts for the comparison of model predictions to experimental data. In particular, ScoreNet.R compares model predictions to a cloud-stored MIDAS-format experimental database to provide a numerical score for tracking model accuracy. Finally, the visualization scripts allow for graphical representations of model topology and behavior. The entire kboolnet toolkit is cloud-enabled, allowing for easy collaborative development; most scripts also allow for the extraction and analysis of individual user-defined "modules".

CONCLUSION

The kboolnet toolkit provides a modular, cloud-enabled workflow for the development of rxncon models, as well as their verification, validation, and visualization. This will enable the creation of larger, more comprehensive, and more rigorous models of cell signaling using the rxncon formalism in the future.

MolClustPy: a Python package to characterize multivalent biomolecular clusters

SUMMARY

Low-affinity interactions among multivalent biomolecules may lead to the formation of molecular complexes that undergo phase transitions to become supply-limited large clusters. In stochastic simulations, such clusters display a wide range of sizes and compositions. We have developed a Python package, MolClustPy, which performs multiple stochastic simulation runs using NFsim (Network-Free stochastic simulator); MolClustPy characterizes and visualizes the distribution of cluster sizes, molecular composition, and bonds across molecular clusters. The statistical analysis offered by MolClustPy is readily applicable to other stochastic simulation software, such as SpringSaLaD and ReaDDy.

AVAILABILITY AND IMPLEMENTATION

The software is implemented in Python. A detailed Jupyter notebook is provided to enable convenient running. Code, user guide, and examples are freely available at https://molclustpy.github.io/.

The maximum solubility product marks the threshold for condensation of multivalent biomolecules

Clustering of weakly interacting multivalent biomolecules underlies the formation of membraneless compartments known as condensates. As opposed to single-component (homotypic) systems, the concentration dependence of multicomponent (heterotypic) condensate formation is not well understood. We previously proposed the solubility product (SP), the product of monomer concentrations in the dilute phase, as a tool for understanding the concentration dependence of multicomponent systems. In this study, we further explore the limits of the SP concept using spatial Langevin dynamics and rule-based stochastic simulations. We show, for a variety of idealized molecular structures, how the maximum SP coincides with the onset of the phase transition, i.e., the formation of large clusters. We reveal the importance of intracluster binding in steering the free and cluster phase molecular distributions. We also show how structural features of biomolecules shape the SP profiles. The interplay of flexibility, length, and steric hindrance of linker regions controls the phase transition threshold. Remarkably, when SPs are normalized to nondimensional variables and plotted against the concentration scaled to the threshold for phase transition, the curves all coincide independent of the structural features of the binding partners. Similar coincidence is observed for the normalized clustering versus concentration plots. Overall, the principles derived from these systematic models will help guide and interpret in vitro and in vivo experiments on the biophysics of biomolecular condensates.

Verifiable biology

The formalization of biological systems using computational modelling approaches as an alternative to mathematical-based methods has recently received much interest because computational models provide a deeper mechanistic understanding of biological systems. In particular, formal verification, complementary approach to standard computational techniques such as simulation, is used to validate the system correctness and obtain critical information about system behaviour. In this study, we survey the most frequently used computational modelling approaches and formal verification techniques for computational biology. We compare a number of verification tools and software suites used to analyse biological systems and biochemical networks, and to verify a wide range of biological properties. For users who have no expertise in formal verification, we present a novel methodology that allows them to easily apply formal verification techniques to analyse their biological or biochemical system of interest.

MolClustPy: A Python Package to Characterize Multivalent Biomolecular Clusters

S ummary

Low-affinity interactions among multivalent biomolecules may lead to the formation of molecular complexes that undergo phase transitions to become extra-large clusters. Characterizing the physical properties of these clusters is important in recent biophysical research. Due to weak interactions such clusters are highly stochastic, demonstrating a wide range of sizes and compositions. We have developed a Python package to perform multiple stochastic simulation runs using NFsim (Network-Free stochastic simulator), characterize and visualize the distribution of cluster sizes, molecular composition, and bonds across molecular clusters and individual molecules of different types.

A vailability and implementation

The software is implemented in Python. A detailed Jupyter notebook is provided to enable convenient running. Code, user guide and examples are freely available at https://molclustpy.github.io/.

C ontact

achattaraj007@gmail.com , blinov@uchc.edu.

S upplementary information

Available at https://molclustpy.github.io/.

Mechanistic model of MAPK signaling reveals how allostery and rewiring contribute to drug resistance

BRAF is prototypical of oncogenes that can be targeted therapeutically and the treatment of BRAF^V600E melanomas with RAF and MEK inhibitors results in rapid tumor regression. However, drug-induced rewiring generates a drug adapted state thought to be involved in acquired resistance and disease recurrence. In this article, we study mechanisms of adaptive rewiring in BRAF^V600E melanoma cells using an energy-based implementation of ordinary differential equation (ODE) modeling in combination with proteomic, transcriptomic and imaging data. We develop a method for causal tracing of ODE models and identify two parallel MAPK reaction channels that are differentially sensitive to RAF and MEK inhibitors due to differences in protein oligomerization and drug binding. We describe how these channels, and timescale separation between immediate-early signaling and transcriptional feedback, create a state in which the RAS-regulated MAPK channel can be activated by growth factors under conditions in which the BRAF^V600E -driven channel is fully inhibited. Further development of the approaches in this article is expected to yield a unified model of adaptive drug resistance in melanoma.

Targeted Quantification of Protein Phosphorylation and Its Contributions towards Mathematical Modeling of Signaling Pathways

Post-translational modifications (PTMs) are key regulatory mechanisms that can control protein function. Of these, phosphorylation is the most common and widely studied. Because of its importance in regulating cell signaling, precise and accurate measurements of protein phosphorylation across wide dynamic ranges are crucial to understanding how signaling pathways function. Although immunological assays are commonly used to detect phosphoproteins, their lack of sensitivity, specificity, and selectivity often make them unreliable for quantitative measurements of complex biological samples. Recent advances in Mass Spectrometry (MS)-based targeted proteomics have made it a more useful approach than immunoassays for studying the dynamics of protein phosphorylation. Selected reaction monitoring (SRM)-also known as multiple reaction monitoring (MRM)-and parallel reaction monitoring (PRM) can quantify relative and absolute abundances of protein phosphorylation in multiplexed fashions targeting specific pathways. In addition, the refinement of these tools by enrichment and fractionation strategies has improved measurement of phosphorylation of low-abundance proteins. The quantitative data generated are particularly useful for building and parameterizing mathematical models of complex phospho-signaling pathways. Potentially, these models can provide a framework for linking analytical measurements of clinical samples to better diagnosis and treatment of disease.

NRN-EZ: an application to streamline biophysical modeling of synaptic integration using NEURON

One of the fundamental goals in neuroscience is to determine how the brain processes information and ultimately controls the execution of complex behaviors. Over the past four decades, there has been a steady growth in our knowledge of the morphological and functional diversity of neurons, the building blocks of the brain. These cells clearly differ not only for their anatomy and ion channel distribution, but also for the type, strength, location, and temporal pattern of activity of the many synaptic inputs they receive. Compartmental modeling programs like NEURON have become widely used in the neuroscience community to address a broad range of research questions, including how neurons integrate synaptic inputs and propagate information through complex neural networks. One of the main strengths of NEURON is its ability to incorporate user-defined information about the realistic morphology and biophysical properties of different cell types. Although the graphical user interface of the program can be used to run initial exploratory simulations, introducing a stochastic representation of synaptic weights, locations and activation times typically requires users to develop their own codes, a task that can be overwhelming for some beginner users. Here we describe NRN-EZ, an interactive application that allows users to specify complex patterns of synaptic input activity that can be integrated as part of NEURON simulations. Through its graphical user interface, NRN-EZ aims to ease the learning curve to run computational models in NEURON, for users that do not necessarily have a computer science background.

Comparison of rule- and ordinary differential equation-based dynamic model of DARPP-32 signalling network

Dynamic modelling has considerably improved our understanding of complex molecular mechanisms. Ordinary differential equations (ODEs) are the most detailed and popular approach to modelling the dynamics of molecular systems. However, their application in signalling networks, characterised by multi-state molecular complexes, can be prohibitive. Contemporary modelling methods, such as rule- based (RB) modelling, have addressed these issues. The advantages of RB modelling over ODEs have been presented and discussed in numerous reviews. In this study, we conduct a direct comparison of the time courses of a molecular system founded on the same reaction network but encoded in the two frameworks. To make such a comparison, a set of reactions that underlie an ODE model was manually encoded in the Kappa language, one of the RB implementations. A comparison of the models was performed at the level of model specification and dynamics, acquired through model simulations. In line with previous reports, we confirm that the Kappa model recapitulates the general dynamics of its ODE counterpart with minor differences. These occur when molecules have multiple sites binding the same interactor. Furthermore, activation of these molecules in the RB model is slower than in the ODE one. As reported for other molecular systems, we find that, also for the DARPP-32 reaction network, the RB representation offers a more expressive and flexible syntax that facilitates access to fine details of the model, easing model reuse. In parallel with these analyses, we report a refactored model of the DARPP-32 interaction network that can serve as a canvas for the development of more complex dynamic models to study this important molecular system.

A group theoretic approach to model comparison with simplicial representations

The complexity of biological systems, and the increasingly large amount of associated experimental data, necessitates that we develop mathematical models to further our understanding of these systems. Because biological systems are generally not well understood, most mathematical models of these systems are based on experimental data, resulting in a seemingly heterogeneous collection of models that ostensibly represent the same system. To understand the system we therefore need to understand how the different models are related to each other, with a view to obtaining a unified mathematical description. This goal is complicated by the fact that a number of distinct mathematical formalisms may be employed to represent the same system, making direct comparison of the models very difficult. A methodology for comparing mathematical models based on their underlying conceptual structure is therefore required. In previous work we developed an appropriate framework for model comparison where we represent models, specifically the conceptual structure of the models, as labelled simplicial complexes and compare them with the two general methodologies of comparison by distance and comparison by equivalence. In this article we continue the development of our model comparison methodology in two directions. First, we present a rigorous and automatable methodology for the core process of comparison by equivalence, namely determining the vertices in a simplicial representation, corresponding to model components, that are conceptually related and the identification of these vertices via simplicial operations. Our methodology is based on considerations of vertex symmetry in the simplicial representation, for which we develop the required mathematical theory of group actions on simplicial complexes. This methodology greatly simplifies and expedites the process of determining model equivalence. Second, we provide an alternative mathematical framework for our model-comparison methodology by representing models as groups, which allows for the direct application of group-theoretic techniques within our model-comparison methodology.

Translational buffering by ribosome stalling in upstream open reading frames

Upstream open reading frames (uORFs) are present in over half of all human mRNAs. uORFs can potently regulate the translation of downstream open reading frames through several mechanisms: siphoning away scanning ribosomes, regulating re-initiation, and allowing interactions between scanning and elongating ribosomes. However, the consequences of these different mechanisms for the regulation of protein expression remain incompletely understood. Here, we performed systematic measurements on the uORF-containing 5' UTR of the cytomegaloviral UL4 mRNA to test alternative models of uORF-mediated regulation in human cells. We find that a terminal diproline-dependent elongating ribosome stall in the UL4 uORF prevents decreases in main ORF protein expression when ribosome loading onto the mRNA is reduced. This uORF-mediated buffering is insensitive to the location of the ribosome stall along the uORF. Computational kinetic modeling based on our measurements suggests that scanning ribosomes dissociate rather than queue when they collide with stalled elongating ribosomes within the UL4 uORF. We identify several human uORFs that repress main ORF protein expression via a similar terminal diproline motif. We propose that ribosome stalls in uORFs provide a general mechanism for buffering against reductions in main ORF translation during stress and developmental transitions.

A transcriptional cycling model recapitulates chromatin-dependent features of noisy inducible transcription

Activation of gene expression in response to environmental cues results in substantial phenotypic heterogeneity between cells that can impact a wide range of outcomes including differentiation, viral activation, and drug resistance. An important source of gene expression noise is transcriptional bursting, or the process by which transcripts are produced during infrequent bursts of promoter activity. Chromatin accessibility impacts transcriptional bursting by regulating the assembly of transcription factor and polymerase complexes on promoters, suggesting that the effect of an activating signal on transcriptional noise will depend on the initial chromatin state at the promoter. To explore this possibility, we simulated transcriptional activation using a transcriptional cycling model with three promoter states that represent chromatin remodeling, polymerase binding and pause release. We initiated this model over a large parameter range representing target genes with different chromatin environments, and found that, upon increasing the polymerase pause release rate to activate transcription, changes in gene expression noise varied significantly across initial promoter states. This model captured phenotypic differences in activation of latent HIV viruses integrated at different chromatin locations and mediated by the transcription factor NF-κB. Activating transcription in the model via increasing one or more of the transcript production rates, as occurs following NF-κB activation, reproduced experimentally measured transcript distributions for four different latent HIV viruses, as well as the bimodal pattern of HIV protein expression that leads to a subset of reactivated virus. Importantly, the parameter ‘activation path’ differentially affected gene expression noise, and ultimately viral activation, in line with experimental observations. This work demonstrates how upstream signaling pathways can be connected to biological processes that underlie transcriptional bursting, resulting in target gene-specific noise profiles following stimulation of a single upstream pathway.

Many genes are transcribed in infrequent bursts of mRNA production through a process called transcriptional bursting, which contributes to variability in responses between cells. Heterogeneity in cell responses can have important biological impacts, such as whether a cell supports viral replication or responds to a drug, and thus there is an effort to describe this process with mathematical models to predict biological outcomes. Previous models described bursting as a transition between an “OFF” state or an “ON” state, an elegant and simple mathematical representation of complex molecular mechanisms, but one which failed to capture how upstream activation signals affected bursting. To address this, we added an additional promoter state to better reflect biological mechanisms underlying bursting. By fitting this model to variable activation of quiescent HIV infections in T cells, we showed that our model more accurately described viral expression variability across cells in response to an upstream stimulus. Our work highlights how mathematical models can be further developed to understand complex biological mechanisms and suggests ways to connect transcriptional bursting to upstream activation pathways.

A scalable, open-source implementation of a large-scale mechanistic model for single cell proliferation and death signaling

Mechanistic models of how single cells respond to different perturbations can help integrate disparate big data sets or predict response to varied drug combinations. However, the construction and simulation of such models have proved challenging. Here, we developed a python-based model creation and simulation pipeline that converts a few structured text files into an SBML standard and is high-performance- and cloud-computing ready. We applied this pipeline to our large-scale, mechanistic pan-cancer signaling model (named SPARCED) and demonstrate it by adding an IFNγ pathway submodel. We then investigated whether a putative crosstalk mechanism could be consistent with experimental observations from the LINCS MCF10A Data Cube that IFNγ acts as an anti-proliferative factor. The analyses suggested this observation can be explained by IFNγ-induced SOCS1 sequestering activated EGF receptors. This work forms a foundational recipe for increased mechanistic model-based data integration on a single-cell level, an important building block for clinically-predictive mechanistic models.

Effect of receptor cooperativity on methylation dynamics in bacterial chemotaxis with weak and strong gradient

We study methylation dynamics of the chemoreceptors as an Escherichia coli cell moves around in a spatially varying chemoattractant environment. We consider attractant concentration with strong and weak spatial gradient. During the uphill and downhill motion of the cell along the gradient, we measure the temporal variation of average methylation level of the receptor clusters. Our numerical simulations we show that the methylation dynamics depends sensitively on the size of the receptor clusters and also on the strength of the gradient. At short times after the beginning of a run, the methylation dynamics is mainly controlled by short runs which are generally associated with high receptor activity. This results in demethylation at short times. But for intermediate or large times, long runs play an important role and depending on receptor cooperativity or gradient strength, the qualitative variation of methylation can be completely different in this time regime. For weak gradient, both for uphill and downhill runs, after the initial demethylation, we find methylation level increases steadily with time for all cluster sizes. Similar qualitative behavior is observed for strong gradient during uphill runs as well. However, the methylation dynamics for downhill runs in strong gradient show highly nontrivial dependence on the receptor cluster size. We explain this behavior as a result of interplay between the sensing and adaptation modules of the signaling network.

A Modular Workflow for Model Building, Analysis, and Parameter Estimation in Systems Biology and Neuroscience

Neuroscience incorporates knowledge from a range of scales, from single molecules to brain wide neural networks. Modeling is a valuable tool in understanding processes at a single scale or the interactions between two adjacent scales and researchers use a variety of different software tools in the model building and analysis process. Here we focus on the scale of biochemical pathways, which is one of the main objects of study in systems biology. While systems biology is among the more standardized fields, conversion between different model formats and interoperability between various tools is still somewhat problematic. To offer our take on tackling these shortcomings and by keeping in mind the FAIR (findability, accessibility, interoperability, reusability) data principles, we have developed a workflow for building and analyzing biochemical pathway models, using pre-existing tools that could be utilized for the storage and refinement of models in all phases of development. We have chosen the SBtab format which allows the storage of biochemical models and associated data in a single file and provides a human readable set of syntax rules. Next, we implemented custom-made MATLAB® scripts to perform parameter estimation and global sensitivity analysis used in model refinement. Additionally, we have developed a web-based application for biochemical models that allows simulations with either a network free solver or stochastic solvers and incorporating geometry. Finally, we illustrate convertibility and use of a biochemical model in a biophysically detailed single neuron model by running multiscale simulations in NEURON. Using this workflow, we can simulate the same model in three different simulators, with a smooth conversion between the different model formats, enhancing the characterization of different aspects of the model.

Can Systems Biology Advance Clinical Precision Oncology?

Precision oncology is perceived as a way forward to treat individual cancer patients. However, knowing particular cancer mutations is not enough for optimal therapeutic treatment, because cancer genotype-phenotype relationships are nonlinear and dynamic. Systems biology studies the biological processes at the systems' level, using an array of techniques, ranging from statistical methods to network reconstruction and analysis, to mathematical modeling. Its goal is to reconstruct the complex and often counterintuitive dynamic behavior of biological systems and quantitatively predict their responses to environmental perturbations. In this paper, we review the impact of systems biology on precision oncology. We show examples of how the analysis of signal transduction networks allows to dissect resistance to targeted therapies and inform the choice of combinations of targeted drugs based on tumor molecular alterations. Patient-specific biomarkers based on dynamical models of signaling networks can have a greater prognostic value than conventional biomarkers. These examples support systems biology models as valuable tools to advance clinical and translational oncological research.

Model comparison via simplicial complexes and persistent homology

In many scientific and technological contexts, we have only a poor understanding of the structure and details of appropriate mathematical models. We often, therefore, need to compare different models. With available data we can use formal statistical model selection to compare and contrast the ability of different mathematical models to describe such data. There is, however, a lack of rigorous methods to compare different models a priori. Here, we develop and illustrate two such approaches that allow us to compare model structures in a systematic way by representing models as simplicial complexes. Using well-developed concepts from simplicial algebraic topology, we define a distance between models based on their simplicial representations. Employing persistent homology with a flat filtration provides for alternative representations of the models as persistence intervals, which represent model structure, from which the model distances are also obtained. We then expand on this measure of model distance to study the concept of model equivalence to determine the conceptual similarity of models. We apply our methodology for model comparison to demonstrate an equivalence between a positional-information model and a Turing-pattern model from developmental biology, constituting a novel observation for two classes of models that were previously regarded as unrelated.

Programmatic modeling for biological systems

Computational modeling has become an established technique to encode mathematical representations of cellular processes and gain mechanistic insights that drive testable predictions. These models are often constructed using graphical user interfaces or domain-specific languages, with community standards used for interchange. Models undergo steady state or dynamic analysis, which can include simulation and calibration within a single application, or transfer across various tools. Here, we describe a novel programmatic modeling paradigm, whereby modeling is augmented with software engineering best practices. We focus on Python - a popular programming language with a large scientific package ecosystem. Models can be encoded as programs, adding benefits such as modularity, testing, and automated documentation generators, while still being extensible and exportable to standardized formats for use with external tools if desired. Programmatic modeling is a key technology to enable collaborative model development and enhance dissemination, transparency, and reproducibility.

RunBioSimulations: an extensible web application that simulates a wide range of computational modeling frameworks, algorithms, and formats

Comprehensive, predictive computational models have significant potential for science, bioengineering, and medicine. One promising way to achieve more predictive models is to combine submodels of multiple subsystems. To capture the multiple scales of biology, these submodels will likely require multiple modeling frameworks and simulation algorithms. Several community resources are already available for working with many of these frameworks and algorithms. However, the variety and sheer number of these resources make it challenging to find and use appropriate tools for each model, especially for novice modelers and experimentalists. To make these resources easier to use, we developed RunBioSimulations (https://run.biosimulations.org), a single web application for executing a broad range of models. RunBioSimulations leverages community resources, including BioSimulators, a new open registry of simulation tools. These resources currently enable RunBioSimulations to execute nine frameworks and 44 algorithms, and they make RunBioSimulations extensible to additional frameworks and algorithms. RunBioSimulations also provides features for sharing simulations and interactively visualizing their results. We anticipate that RunBioSimulations will foster reproducibility, stimulate collaboration, and ultimately facilitate the creation of more predictive models.

BiPSim: a flexible and generic stochastic simulator for polymerization processes

Detailed whole-cell modeling requires an integration of heterogeneous cell processes having different modeling formalisms, for which whole-cell simulation could remain tractable. Here, we introduce BiPSim, an open-source stochastic simulator of template-based polymerization processes, such as replication, transcription and translation. BiPSim combines an efficient abstract representation of reactions and a constant-time implementation of the Gillespie’s Stochastic Simulation Algorithm (SSA) with respect to reactions, which makes it highly efficient to simulate large-scale polymerization processes stochastically. Moreover, multi-level descriptions of polymerization processes can be handled simultaneously, allowing the user to tune a trade-off between simulation speed and model granularity. We evaluated the performance of BiPSim by simulating genome-wide gene expression in bacteria for multiple levels of granularity. Finally, since no cell-type specific information is hard-coded in the simulator, models can easily be adapted to other organismal species. We expect that BiPSim should open new perspectives for the genome-wide simulation of stochastic phenomena in biology.

The solubility product extends the buffering concept to heterotypic biomolecular condensates

Biomolecular condensates are formed by liquid-liquid phase separation (LLPS) of multivalent molecules. LLPS from a single ("homotypic") constituent is governed by buffering: above a threshold, free monomer concentration is clamped, with all added molecules entering the condensed phase. However, both experiment and theory demonstrate that buffering fails for the concentration dependence of multicomponent ("heterotypic") LLPS. Using network-free stochastic modeling, we demonstrate that LLPS can be described by the solubility product constant (Ksp): the product of free monomer concentrations, accounting for the ideal stoichiometries governed by the valencies, displays a threshold above which additional monomers are funneled into large clusters; this reduces to simple buffering for homotypic systems. The Ksp regulates the composition of the dilute phase for a wide range of valencies and stoichiometries. The role of Ksp is further supported by coarse-grained spatial particle simulations. Thus, the solubility product offers a general formulation for the concentration dependence of LLPS.

TNF stimulation primarily modulates transcriptional burst size of NF-κB-regulated genes

Cell-to-cell heterogeneity is a feature of the tumor necrosis factor (TNF)-stimulated inflammatory response mediated by the transcription factor NF-κB, motivating an exploration of the underlying sources of this noise. Here, we combined single-transcript measurements with computational models to study transcriptional noise at six NF-κB-regulated inflammatory genes. In the basal state, NF-κB-target genes displayed an inverse correlation between mean and noise characteristic of transcriptional bursting. By analyzing transcript distributions with a bursting model, we found that TNF primarily activated transcription by increasing burst size while maintaining burst frequency for gene promoters with relatively high basal histone 3 acetylation (AcH3) that marks open chromatin environments. For promoters with lower basal AcH3 or when AcH3 was decreased with a small molecule drug, the contribution of burst frequency to TNF activation increased. Finally, we used a mathematical model to show that TNF positive feedback amplified gene expression noise resulting from burst size-mediated transcription, leading to a subset of cells with high TNF protein expression. Our results reveal potential sources of noise underlying intercellular heterogeneity in the TNF-mediated inflammatory response.

Nested active learning for efficient model contextualization and parameterization: pathway to generating simulated populations using multi-scale computational models

There is increasing interest in the use of mechanism-based multi-scale computational models (such as agent-based models (ABMs)) to generate simulated clinical populations in order to discover and evaluate potential diagnostic and therapeutic modalities. The description of the environment in which a biomedical simulation operates (model context) and parameterization of internal model rules (model content) requires the optimization of a large number of free parameters. In this work, we utilize a nested active learning (AL) workflow to efficiently parameterize and contextualize an ABM of systemic inflammation used to examine sepsis. Contextual parameter space was examined using four parameters external to the model's rule set. The model's internal parameterization, which represents gene expression and associated cellular behaviors, was explored through the augmentation or inhibition of signaling pathways for 12 signaling mediators associated with inflammation and wound healing. We have implemented a nested AL approach in which the clinically relevant (CR) model environment space for a given internal model parameterization is mapped using a small Artificial Neural Network (ANN). The outer AL level workflow is a larger ANN that uses AL to efficiently regress the volume and centroid location of the CR space given by a single internal parameterization. We have reduced the number of simulations required to efficiently map the CR parameter space of this model by approximately 99%. In addition, we have shown that more complex models with a larger number of variables may expect further improvements in efficiency.

Atlas: automatic modeling of regulation of bacterial gene expression and metabolism using rule-based languages

MOTIVATION

Cells are complex systems composed of hundreds of genes whose products interact to produce elaborated behaviors. To control such behaviors, cells rely on transcription factors to regulate gene expression, and gene regulatory networks (GRNs) are employed to describe and understand such behavior. However, GRNs are static models, and dynamic models are difficult to obtain due to their size, complexity, stochastic dynamics and interactions with other cell processes.

RESULTS

We developed Atlas, a Python software that converts genome graphs and gene regulatory, interaction and metabolic networks into dynamic models. The software employs these biological networks to write rule-based models for the PySB framework. The underlying method is a divide-and-conquer strategy to obtain sub-models and combine them later into an ensemble model. To exemplify the utility of Atlas, we used networks of varying size and complexity of Escherichia coli and evaluated in silico modifications, such as gene knockouts and the insertion of promoters and terminators. Moreover, the methodology could be applied to the dynamic modeling of natural and synthetic networks of any bacteria.

AVAILABILITY AND IMPLEMENTATION

Code, models and tutorials are available online (https://github.com/networkbiolab/atlas).

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Exact Maximal Reduction Of Stochastic Reaction Networks By Species Lumping

MOTIVATION

Stochastic reaction networks are a widespread model to describe biological systems where the presence of noise is relevant, such as in cell regulatory processes. Unfortunately, in all but simplest models the resulting discrete state-space representation hinders analytical tractability and makes numerical simulations expensive. Reduction methods can lower complexity by computing model projections that preserve dynamics of interest to the user.

RESULTS

We present an exact lumping method for stochastic reaction networks with mass-action kinetics. It hinges on an equivalence relation between the species, resulting in a reduced network where the dynamics of each macro-species is stochastically equivalent to the sum of the original species in each equivalence class, for any choice of the initial state of the system. Furthermore, by an appropriate encoding of kinetic parameters as additional species, the method can establish equivalences that do not depend on specific values of the parameters. The method is supported by an efficient algorithm to compute the largest species equivalence, thus the maximal lumping. The effectiveness and scalability of our lumping technique, as well as the physical interpretability of resulting reductions, is demonstrated in several models of signaling pathways and epidemic processes on complex networks.

AVAILABILITY

The algorithms for species equivalence have been implemented in the software tool ERODE, freely available for download from https://www.erode.eu.

CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations

MOTIVATION

Detailed mechanistic models of biological processes can pose significant challenges for analysis and parameter estimations due to the large number of equations used to track the dynamics of all distinct configurations in which each involved biochemical species can be found. Model reduction can help tame such complexity by providing a lower-dimensional model in which each macro-variable can be directly related to the original variables.

RESULTS

We present CLUE, an algorithm for exact model reduction of systems of polynomial differential equations by constrained linear lumping. It computes the smallest dimensional reduction as a linear mapping of the state space such that the reduced model preserves the dynamics of user-specified linear combinations of the original variables. Even though CLUE works with nonlinear differential equations, it is based on linear algebra tools, which makes it applicable to high-dimensional models. Using case studies from the literature, we show how CLUE can substantially lower model dimensionality and help extract biologically intelligible insights from the reduction.

AVAILABILITY

An implementation of the algorithm and relevant resources to replicate the experiments herein reported are freely available for download at https://github.com/pogudingleb/CLUE.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

A compiler for biological networks on silicon chips

The explosive growth in semiconductor integrated circuits was made possible in large part by design automation software. The design and/or analysis of synthetic and natural circuits in living cells could be made more scalable using the same approach. We present a compiler which converts standard representations of chemical reaction networks and circuits into hardware configurations that can be used to simulate the network on specialized cytomorphic hardware. The compiler also creates circuit–level models of the target configuration, which enhances the versatility of the compiler and enables the validation of its functionality without physical experimentation with the hardware. We show that this compiler can translate networks comprised of mass–action kinetics, classic enzyme kinetics (Michaelis–Menten, Briggs–Haldane, and Botts–Morales formalisms), and genetic repressor kinetics, thereby allowing a large class of models to be transformed into a hardware representation. Rule–based models are particularly well–suited to this approach, as we demonstrate by compiling a MAP kinase model. Development of specialized hardware and software for simulating biological networks has the potential to enable the simulation of larger kinetic models than are currently feasible or allow the parallel simulation of many smaller networks with better performance than current simulation software.

We present a “silicon compiler” that is capable of translating biochemical models encoded in the SBML standard into specialized analog cytomorphic hardware and transfer function–level simulations of such hardware. We show how the compiler and hardware address challenges in analog computing: 1) We ensure that the integration of errors due to the mismatch between analog circuit parameters does not become infinite over time but always remains finite via the use of total variables (the solution of the “divergence problem”); 2) We describe the compilation process through a series of examples using building blocks of biological networks, and show the results of compiling two SBML models from the literature: the Elowitz repressilator model and a rule–based model of a MAP kinase cascade. Source code for the compiler is available at https://doi.org/10.5281/zenodo.3948393.

Executable biochemical space for specification and analysis of biochemical systems

Computational systems biology provides multiple formalisms for modelling of biochemical processes among which the rule-based approach is one of the most suitable. Its main advantage is a compact and precise mechanistic description of complex processes. However, state-of-the-art rule-based languages still suffer several shortcomings that limit their use in practice. In particular, the elementary (low-level) syntax and semantics of rule-based languages complicate model construction and maintenance for users outside computer science. On the other hand, mathematical models based on differential equations (ODEs) still make the most typical used modelling framework. In consequence, robust re-interpretation and integration of models are difficult, thus making the systems biology paradigm technically challenging. Though several high-level languages have been developed at the top of rule-based principles, none of them provides a satisfactory and complete solution for semi-automated description and annotation of heterogeneous biophysical processes integrated at the cellular level. We present the second generation of a rule-based language called Biochemical Space Language (BCSL) that combines the advantages of different approaches and thus makes an effort to overcome several problems of existing solutions. BCSL relies on the formal basis of the rule-based methodology while preserving user-friendly syntax of plain chemical equations. BCSL combines the following aspects: the level of abstraction that hides structural and quantitative details but yet gives a precise mechanistic view of systems dynamics; executable semantics allowing formal analysis and consistency checking at the level of the language; universality allowing the integration of different biochemical mechanisms; scalability and compactness of the specification; hierarchical specification and composability of chemical entities; and support for genome-scale annotation.

Interactions between calmodulin and neurogranin govern the dynamics of CaMKII as a leaky integrator

Calmodulin-dependent kinase II (CaMKII) has long been known to play an important role in learning and memory as well as long term potentiation (LTP). More recently it has been suggested that it might be involved in the time averaging of synaptic signals, which can then lead to the high precision of information stored at a single synapse. However, the role of the scaffolding molecule, neurogranin (Ng), in governing the dynamics of CaMKII is not yet fully understood. In this work, we adopt a rule-based modeling approach through the Monte Carlo method to study the effect of Ca2+ signals on the dynamics of CaMKII phosphorylation in the postsynaptic density (PSD). Calcium surges are observed in synaptic spines during an EPSP and back-propagating action potential due to the opening of NMDA receptors and voltage dependent calcium channels. Using agent-based models, we computationally investigate the dynamics of phosphorylation of CaMKII monomers and dodecameric holoenzymes. The scaffolding molecule, Ng, when present in significant concentration, limits the availability of free calmodulin (CaM), the protein which activates CaMKII in the presence of calcium. We show that Ng plays an important modulatory role in CaMKII phosphorylation following a surge of high calcium concentration. We find a non-intuitive dependence of this effect on CaM concentration that results from the different affinities of CaM for CaMKII depending on the number of calcium ions bound to the former. It has been shown previously that in the absence of phosphatase, CaMKII monomers integrate over Ca2+ signals of certain frequencies through autophosphorylation (Pepke et al, Plos Comp. Bio., 2010). We also study the effect of multiple calcium spikes on CaMKII holoenzyme autophosphorylation, and show that in the presence of phosphatase, CaMKII behaves as a leaky integrator of calcium signals, a result that has been recently observed in vivo. Our models predict that the parameters of this leaky integrator are finely tuned through the interactions of Ng, CaM, CaMKII, and PP1, providing a mechanism to precisely control the sensitivity of synapses to calcium signals. Author Summary not valid for PLOS ONE submissions.

Understanding the Dynamics of T-Cell Activation in Health and Disease Through the Lens of Computational Modeling

T cells in the immune system are activated by binding to foreign peptides (from an external pathogen) or mutant peptide (derived from endogenous proteins) displayed on the surface of a diseased cell. This triggers a series of intracellular signaling pathways, which ultimately dictate the response of the T cell. The insights from computational models have greatly improved our understanding of the mechanisms that control T-cell activation. In this review, we focus on the use of ordinary differential equation–based mechanistic models to study T-cell activation. We highlight several examples that demonstrate the models’ utility in answering specific questions related to T-cell activation signaling, from antigen discrimination to the feedback mechanisms that initiate transcription factor activation. In addition, we describe other modeling approaches that can be combined with mechanistic models to bridge time scales and better understand how intracellular signaling events, which occur on the order of seconds to minutes, influence phenotypic responses of T-cell activation, which occur on the order of hours to days. Overall, through concrete examples, we emphasize how computational modeling can be used to enable the rational design and optimization of immunotherapies.

NERDSS: A Nonequilibrium Simulator for Multibody Self-Assembly at the Cellular Scale

Currently, a significant barrier to building predictive models of cellular self-assembly processes is that molecular models cannot capture minutes-long dynamics that couple distinct components with active processes, whereas reaction-diffusion models cannot capture structures of molecular assembly. Here, we introduce the nonequilibrium reaction-diffusion self-assembly simulator (NERDSS), which addresses this spatiotemporal resolution gap. NERDSS integrates efficient reaction-diffusion algorithms into generalized software that operates on user-defined molecules through diffusion, binding and orientation, unbinding, chemical transformations, and spatial localization. By connecting the fast processes of binding with the slow timescales of large-scale assembly, NERDSS integrates molecular resolution with reversible formation of ordered, multisubunit complexes. NERDSS encodes models using rule-based formatting languages to facilitate model portability, usability, and reproducibility. Applying NERDSS to steps in clathrin-mediated endocytosis, we design multicomponent systems that can form lattices in solution or on the membrane, and we predict how stochastic but localized dephosphorylation of membrane lipids can drive lattice disassembly. The NERDSS simulations reveal the spatial constraints on lattice growth and the role of membrane localization and cooperativity in nucleating assembly. By modeling viral lattice assembly and recapitulating oscillations in protein expression levels for a circadian clock model, we illustrate the adaptability of NERDSS. NERDSS simulates user-defined assembly models that were previously inaccessible to existing software tools, with broad applications to predicting self-assembly in vivo and designing high-yield assemblies in vitro.

The FLAME-accelerated signalling tool (FaST) for facile parallelisation of flexible agent-based models of cell signalling

Agent-based modelling is particularly adept at modelling complex features of cell signalling pathways, where heterogeneity, stochastic and spatial effects are important, thus increasing our understanding of decision processes in biology in such scenarios. However, agent-based modelling often is computationally prohibitive to implement. Parallel computing, either on central processing units (CPUs) or graphical processing units (GPUs), can provide a means to improve computational feasibility of agent-based applications but generally requires specialist coding knowledge and extensive optimisation. In this paper, we address these challenges through the development and implementation of the FLAME-accelerated signalling tool (FaST), a software that permits easy creation and parallelisation of agent-based models of cell signalling, on CPUs or GPUs. FaST incorporates validated new agent-based methods, for accurate modelling of reaction kinetics and, as proof of concept, successfully converted an ordinary differential equation (ODE) model of apoptosis execution into an agent-based model. We finally parallelised this model through FaST on CPUs and GPUs resulting in an increase in performance of 5.8× (16 CPUs) and 53.9×, respectively. The FaST takes advantage of the communicating X-machine approach used by FLAME and FLAME GPU to allow easy alteration or addition of functionality to parallel applications, but still includes inherent parallelisation optimisation. The FaST, therefore, represents a new and innovative tool to easily create and parallelise bespoke, robust, agent-based models of cell signalling.

Applications of personalised signalling network models in precision oncology

As our ability to provide in-depth, patient-specific characterisation of the molecular alterations within tumours rapidly improves, it is becoming apparent that new approaches will be required to leverage the power of this data and derive the full benefit for each individual patient. Systems biology approaches are beginning to emerge within this field as a potential method of incorporating large volumes of network level data and distilling a coherent, clinically-relevant prediction of drug response. However, the initial promise of this developing field is yet to be realised. Here we argue that in order to develop these precise models of individual drug response and tailor treatment accordingly, we will need to develop mathematical models capable of capturing both the dynamic nature of drug-response signalling networks and key patient-specific information such as mutation status or expression profiles. We also review the modelling approaches commonly utilised within this field, and outline recent examples of their use in furthering the application of systems biology for a precision medicine approach to cancer treatment.

A scalable method for parameter-free simulation and validation of mechanistic cellular signal transduction network models

The metabolic modelling community has established the gold standard for bottom-up systems biology with reconstruction, validation and simulation of mechanistic genome-scale models. Similar methods have not been established for signal transduction networks, where the representation of complexes and internal states leads to scalability issues in both model formulation and execution. While rule- and agent-based methods allow efficient model definition and execution, respectively, model parametrisation introduces an additional layer of uncertainty due to the sparsity of reliably measured parameters. Here, we present a scalable method for parameter-free simulation of mechanistic signal transduction networks. It is based on rxncon and uses a bipartite Boolean logic with separate update rules for reactions and states. Using two generic update rules, we enable translation of any rxncon model into a unique Boolean model, which can be used for network validation and simulation-allowing the prediction of system-level function directly from molecular mechanistic data. Through scalable model definition and simulation, and the independence of quantitative parameters, it opens up for simulation and validation of mechanistic genome-scale models of signal transduction networks.

A multi-state model of the CaMKII dodecamer suggests a role for calmodulin in maintenance of autophosphorylation

Ca2+/calmodulin-dependent protein kinase II (CaMKII) accounts for up to 2 percent of all brain protein and is essential to memory function. CaMKII activity is known to regulate dynamic shifts in the size and signaling strength of neuronal connections, a process known as synaptic plasticity. Increasingly, computational models are used to explore synaptic plasticity and the mechanisms regulating CaMKII activity. Conventional modeling approaches may exclude biophysical detail due to the impractical number of state combinations that arise when explicitly monitoring the conformational changes, ligand binding, and phosphorylation events that occur on each of the CaMKII holoenzyme's subunits. To manage the combinatorial explosion without necessitating bias or loss in biological accuracy, we use a specialized syntax in the software MCell to create a rule-based model of a twelve-subunit CaMKII holoenzyme. Here we validate the rule-based model against previous experimental measures of CaMKII activity and investigate molecular mechanisms of CaMKII regulation. Specifically, we explore how Ca2+/CaM-binding may both stabilize CaMKII subunit activation and regulate maintenance of CaMKII autophosphorylation. Noting that Ca2+/CaM and protein phosphatases bind CaMKII at nearby or overlapping sites, we compare model scenarios in which Ca2+/CaM and protein phosphatase do or do not structurally exclude each other's binding to CaMKII. Our results suggest a functional mechanism for the so-called "CaM trapping" phenomenon, wherein Ca2+/CaM may structurally exclude phosphatase binding and thereby prolong CaMKII autophosphorylation. We conclude that structural protection of autophosphorylated CaMKII by Ca2+/CaM may be an important mechanism for regulation of synaptic plasticity.

Parameter Estimation and Uncertainty Quantification for Systems Biology Models

Mathematical models can provide quantitative insights into immunoreceptor signaling, and other biological processes, but require parameterization and uncertainty quantification before reliable predictions become possible. We review currently available methods and software tools to address these problems. We consider gradient-based and gradient-free methods for point estimation of parameter values, and methods of profile likelihood, bootstrapping, and Bayesian inference for uncertainty quantification. We consider recent and potential future applications of these methods to systems-level modeling of immune-related phenomena.

Analysis of Fn14-NF-κB signaling response dynamics using a mechanistic model

Fn14 is a transmembrane receptor protein belonging to the tumor necrosis factor receptor (TNFR) superfamily. Many experimental reports have shown that crosslinking of the receptor by its extracellular ligand TWEAK induces prolonged activation of transcription factor NF-κB. This behavior is distinct from TNF-α receptor, which is a more well-characterized member of the TNFR family. TNF-α receptor, despite sharing many similar molecular interactions with Fn14, only transiently activates NF-κB in response to TNF-α stimulation. Here, we investigate molecular mechanisms that enable Fn14 to display such distinctive behavior. In particular, we focus on two specific features of the Fn14 pathway that potentially give rise to a positive feedback regulation and differentiate it from the TNF-α receptor signaling. By developing a mechanistic model, we analyze how these features may determine the dynamics of an Fn14-NF-κB response. Our analysis reveals that stimulation of Fn14 by TWEAK may generate highly non-linear dynamics, including stable limit cycles and bistable responses. The type of response depends both on the strength and duration of a TWEAK signal. Our predictions and analyses also show that the molecular interactions underlying the positive feedback explain the prolonged activation of NF-κB under certain parameter regimes. In light of the model predictions, we propose possible deregulations of Fn14 leading to its overexpression in solid tumors and tissue injuries.

PyBioNetFit and the Biological Property Specification Language

In systems biology modeling, important steps include model parameterization, uncertainty quantification, and evaluation of agreement with experimental observations. To help modelers perform these steps, we developed the software PyBioNetFit, which in addition supports checking models against known system properties and solving design problems. PyBioNetFit introduces Biological Property Specification Language (BPSL) for the formal declaration of system properties. BPSL allows qualitative data to be used alone or in combination with quantitative data. PyBioNetFit performs parameterization with parallelized metaheuristic optimization algorithms that work directly with existing model definition standards: BioNetGen Language (BNGL) and Systems Biology Markup Language (SBML). We demonstrate PyBioNetFit's capabilities by solving various example problems, including the challenging problem of parameterizing a 153-parameter model of cell cycle control in yeast based on both quantitative and qualitative data. We demonstrate the model checking and design applications of PyBioNetFit and BPSL by analyzing a model of targeted drug interventions in autophagy signaling.

Inverted translational control of eukaryotic gene expression by ribosome collisions

The canonical model of eukaryotic translation posits that efficient translation initiation increases protein expression and mRNA stability. Contrary to this model, we find that increasing initiation rate can decrease both protein expression and stability of certain mRNAs in the budding yeast Saccharomyces cerevisiae. These mRNAs encode a stretch of polybasic residues that cause ribosome stalling. Our computational modeling predicts that the observed decrease in gene expression at high initiation rates occurs when ribosome collisions at stalls stimulate abortive termination of the leading ribosome or cause endonucleolytic mRNA cleavage. Consistent with this prediction, the collision-associated quality-control factors Asc1 and Hel2 (orthologs of human RACK1 and ZNF598, respectively) decrease gene expression from stall-containing mRNAs only at high initiation rates. Remarkably, hundreds of S. cerevisiae mRNAs that contain ribosome stall sequences also exhibit lower translation efficiency. We propose that inefficient translation initiation allows these stall-containing endogenous mRNAs to escape collision-stimulated reduction in gene expression.

Higher rates of translation counterintuitively lead to lower protein levels from eukaryotic mRNAs that encode ribosome stalls; modelling suggests that this occurs when ribosome collisions at stalls trigger abortive termination of the leading ribosome or cause endonucleolytic mRNA cleavage.

Rule-Based Modeling Using Wildcards in the Smoldyn Simulator

Many biological molecules exist in multiple variants, such as proteins with different posttranslational modifications, DNAs with different sequences, and phospholipids with different chain lengths. Representing these variants as distinct species, as most biochemical simulators do, leads to the problem that the number of species, and chemical reactions that interconvert them, typically increase combinatorially with the number of ways that the molecules can vary. This can be alleviated by "rule-based modeling methods," in which software generates the chemical reaction network from relatively simple "rules." This chapter presents a new approach to rule-based modeling. It is based on wildcards that match to species names, much as wildcards can match to file names in computer operating systems. It is much simpler to use than the formal rule-based modeling approaches developed previously but can lead to unintended consequences if not used carefully. This chapter demonstrates rule-based modeling with wildcards through examples for signaling systems, protein complexation, polymerization, nucleic acid sequence copying and mutation, the "SMILES" chemical notation, and others. The method is implemented in Smoldyn, a spatial and stochastic biochemical simulator, for both generate-first and on-the-fly expansion, meaning whether the reaction network is generated before or during the simulation.

Scaling methods for accelerating kinetic Monte Carlo simulations of chemical reaction networks

Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. Here, we present a new acceleration algorithm based on adaptive and heterogeneous scaling of reaction rates and stoichiometric coefficients. The algorithm is conceptually related to the commonly used idea of accelerating a stochastic simulation by considering a subvolume λΩ (0 < λ < 1) within a system of interest, which reduces the number of reaction events per unit time occurring in a simulation by a factor 1/λ at the cost of greater error in unbiased estimates of first moments and biased overestimates of second moments. Our new approach offers two unique benefits. First, scaling is adaptive and heterogeneous, which eliminates the pitfall of overaggressive scaling. Second, there is no need for an a priori classification of populations as discrete or continuous (as in a hybrid method), which is problematic when discreteness of a chemical species changes during a simulation. The method requires specification of only a single algorithmic parameter, N_c, a global critical population size above which populations are effectively scaled down to increase simulation efficiency. The method, which we term partial scaling, is implemented in the open-source BioNetGen software package. We demonstrate that partial scaling can significantly accelerate simulations without significant loss of accuracy for several published models of biological systems. These models characterize activation of the mitogen-activated protein kinase ERK, prion protein aggregation, and T-cell receptor signaling.

Using RuleBuilder to Graphically Define and Visualize BioNetGen-Language Patterns and Reaction Rules

RuleBuilder is a tool for drawing graphs that can be represented by the BioNetGen language (BNGL), which is used to formulate mathematical, rule-based models of biochemical systems. BNGL provides an intuitive plain text, or string, representation of such systems, which is based on a graphical formalism. Reactions are defined in terms of graph-rewriting rules that specify the necessary intrinsic properties of the reactants, a transformation, and a rate law. Rules also contain contextual constraints that restrict application of the rule. In some cases, the specification of contextual constraints can be verbose, making a rule difficult to read. RuleBuilder is designed to ease the task of reading and writing individual reaction rules or other BNGL patterns required for model formulation. The software assists in the reading of existing models by converting BNGL strings of interest into a graph-based representation composed of nodes and edges. RuleBuilder also enables the user to construct de novo a visual representation of BNGL strings using drawing tools available in its interface. As objects are added to the drawing canvas, the corresponding BNGL string is generated on the fly, and objects are similarly drawn on the fly as BNGL strings are entered into the application. RuleBuilder thus facilitates construction and interpretation of rule-based models.

RKappa: Software for Analyzing Rule-Based Models

RKappa is a framework for the development, simulation, and analysis of rule-based models within the mature statistically empowered R environment. It is designed for model editing, parameter identification, simulation, sensitivity analysis, and visualization. The framework is optimized for high-performance computing platforms and facilitates analysis of large-scale systems biology models where knowledge of exact mechanisms is limited and parameter values are uncertain.The RKappa software is an open-source (GLP3 license) package for R, which is freely available online ( https://github.com/lptolik/R4Kappa ).

Review of the systems biology of the immune system using agent-based models

The immune system is an inherent protection system in vertebrate animals including human beings that exhibit properties such as self-organisation, self-adaptation, learning, and recognition. It interacts with the other allied systems such as the gut and lymph nodes. There is a need for immune system modelling to know about its complex internal mechanism, to understand how it maintains the homoeostasis, and how it interacts with the other systems. There are two types of modelling techniques used for the simulation of features of the immune system: equation-based modelling (EBM) and agent-based modelling. Owing to certain shortcomings of the EBM, agent-based modelling techniques are being widely used. This technique provides various predictions for disease causes and treatments; it also helps in hypothesis verification. This study presents a review of agent-based modelling of the immune system and its interactions with the gut and lymph nodes. The authors also review the modelling of immune system interactions during tuberculosis and cancer. In addition, they also outline the future research directions for the immune system simulation through agent-based techniques such as the effects of stress on the immune system, evolution of the immune system, and identification of the parameters for a healthy immune system.

Modeling cell line-specific recruitment of signaling proteins to the insulin-like growth factor 1 receptor

Receptor tyrosine kinases (RTKs) typically contain multiple autophosphorylation sites in their cytoplasmic domains. Once activated, these autophosphorylation sites can recruit downstream signaling proteins containing Src homology 2 (SH2) and phosphotyrosine-binding (PTB) domains, which recognize phosphotyrosine-containing short linear motifs (SLiMs). These domains and SLiMs have polyspecific or promiscuous binding activities. Thus, multiple signaling proteins may compete for binding to a common SLiM and vice versa. To investigate the effects of competition on RTK signaling, we used a rule-based modeling approach to develop and analyze models for ligand-induced recruitment of SH2/PTB domain-containing proteins to autophosphorylation sites in the insulin-like growth factor 1 (IGF1) receptor (IGF1R). Models were parameterized using published datasets reporting protein copy numbers and site-specific binding affinities. Simulations were facilitated by a novel application of model restructuration, to reduce redundancy in rule-derived equations. We compare predictions obtained via numerical simulation of the model to those obtained through simple prediction methods, such as through an analytical approximation, or ranking by copy number and/or K_D value, and find that the simple methods are unable to recapitulate the predictions of numerical simulations. We created 45 cell line-specific models that demonstrate how early events in IGF1R signaling depend on the protein abundance profile of a cell. Simulations, facilitated by model restructuration, identified pairs of IGF1R binding partners that are recruited in anti-correlated and correlated fashions, despite no inclusion of cooperativity in our models. This work shows that the outcome of competition depends on the physicochemical parameters that characterize pairwise interactions, as well as network properties, including network connectivity and the relative abundances of competitors.

Cells rely on networks of interacting biomolecules to sense and respond to environmental perturbations and signals. However, it is unclear how information is processed to generate appropriate and specific responses to signals, especially given that these networks tend to share many components. For example, receptors that detect distinct ligands and regulate distinct cellular activities commonly interact with overlapping sets of downstream signaling proteins. Here, to investigate the downstream signaling of a well-studied receptor tyrosine kinase (RTK), the insulin-like growth factor 1 (IGF1) receptor (IGF1R), we formulated and analyzed 45 cell line-specific mathematical models, which account for recruitment of 18 different binding partners to six sites of receptor autophosphorylation in IGF1R. The models were parameterized using available protein copy number and site-specific affinity measurements, and restructured to allow for network generation. We find that recruitment is influenced by the protein abundance profile of a cell, with different patterns of recruitment in different cell lines. Furthermore, in a given cell line, we find that pairs of IGF1R binding partners may be recruited in a correlated or anti-correlated fashion. We demonstrate that the simulations of the model have greater predictive power than protein copy number and/or binding affinity data, and that even a simple analytical model cannot reproduce the predicted recruitment ranking obtained via simulations. These findings represent testable predictions and indicate that the outputs of IGF1R signaling depend on cell line-specific properties in addition to the properties that are intrinsic to the biomolecules involved.