scBoolSeq: Linking scRNA-seq statistics and Boolean dynamics.

Boolean networks are largely employed to model the qualitative dynamics of cell fate processes by describing the change of binary activation states of genes and transcription factors with time. Being able to bridge such qualitative states with quantitative measurements of gene expressions in cells, as scRNA-seq, is a cornerstone for data-driven model construction and validation. On one hand, scRNA-seq binarisation is a key step for inferring and validating Boolean models. On the other hand, the generation of synthetic scRNA-seq data from baseline Boolean models provides an important asset to benchmark inference methods. However, linking characteristics of scRNA-seq datasets, including dropout events, with Boolean states is a challenging task. We present scBoolSeq, a method for the bidirectional linking of scRNA-seq data and Boolean activation state of genes. Given a reference scRNA-seq dataset, scBoolSeq computes statistical criteria to classify the empirical gene pseudocount distributions as either unimodal, bimodal, or zero-inflated, and fit a probabilistic model of dropouts, with gene-dependent parameters. From these learnt distributions, scBoolSeq can perform both binarisation of scRNA-seq datasets, and generate synthetic scRNA-seq datasets from Boolean traces, as issued from Boolean networks, using biased sampling and dropout simulation. We present a case study demonstrating the application of scBoolSeq's binarisation scheme in data-driven model inference. Furthermore, we compare synthetic scRNA-seq data generated by scBoolSeq with BoolODE's, data for the same Boolean Network model. The comparison shows that our method better reproduces the statistics of real scRNA-seq datasets, such as the mean-variance and mean-dropout relationships while exhibiting clearly defined trajectories in two-dimensional projections of the data.

Towards a qualitative theory of the interruption of eating behavior change.

The poor maintenance of eating behavior change is one of the main obstacles to minimizing weight regain after weight loss during diets for non-surgical care of obese or overweight patients. We start with a known informal explanation of interruption in eating behavior change during severe restriction and formalize it as a causal network involving psychological variables, which we extend with energetic variables governed by principles of thermodynamics. The three core phenomena of dietary behavior change, i.e., non-initiation, initiation followed by discontinuation and initiation followed by non-discontinuation, are expressed in terms of the value of the key variable representing mood or psychological energy, the fluctuation of which is the result of three causal relationships. Based on our experimental knowledge of the time evolution profile of the three causal input variables, we then proceed to a qualitative analysis of the resulting theory, i.e., we consider an over-approximation of it which, after discretization, can be expressed in the form of a finite integer-based model. Using Answer Set Programming, we show that our formal model faithfully reproduces the three phenomena and, under a certain assumption, is minimal. We generalize this result by providing all the minimal models reproducing these phenomena when the possible causal relationships exerted on mood are extended to all the other variables (not just those assumed in the informal explanation), with arbitrary causality signs. Finally, by a direct analytical resolution of an under-approximation of our theory, obtained by assuming linear causalities, as a system of linear ODEs, we find exactly the same minimal models, proving that they are also equal to the actual minimal models of our theory since these are framed below and above by the models of the under-approximation and the over-approximation. We determine which parameters need to be person-specific and which can be considered invariant, i.e., we explain inter-individual variability. Our approach could pave the way for universally accepted theories in the field of behavior change and, more broadly, in other areas of psychology.

MERRIN: MEtabolic regulation rule INference from time series data.

MOTIVATION: Many techniques have been developed to infer Boolean regulations from a prior knowledge network (PKN) and experimental data. Existing methods are able to reverse-engineer Boolean regulations for transcriptional and signaling networks, but they fail to infer regulations that control metabolic networks. RESULTS: We present a novel approach to infer Boolean rules for metabolic regulation from time-series data and a PKN. Our method is based on a combination of answer set programming and linear programming. By solving both combinatorial and linear arithmetic constraints, we generate candidate Boolean regulations that can reproduce the given data when coupled to the metabolic network. We evaluate our approach on a core regulated metabolic network and show how the quality of the predictions depends on the available kinetic, fluxomics or transcriptomics time-series data. AVAILABILITY AND IMPLEMENTATION: Software available at https://github.com/bioasp/merrin. SUPPLEMENTARY INFORMATION: Supplementary data are available at https://doi.org/10.5281/zenodo.6670164.

A detailed map of coupled circadian clock and cell cycle with qualitative dynamics validation.

BACKGROUND: The temporal coordination of biological processes by the circadian clock is an important mechanism, and its disruption has negative health outcomes, including cancer. Experimental and theoretical evidence suggests that the oscillators driving the circadian clock and the cell cycle are coupled through phase locking. RESULTS: We present a detailed and documented map of known mechanisms related to the regulation of the circadian clock, and its coupling with an existing cell cycle map which includes main interactions of the mammalian cell cycle. The coherence of the merged map has been validated with a qualitative dynamics analysis. We verified that the coupled circadian clock and cell cycle maps reproduce the observed sequence of phase markers. Moreover, we predicted mutations that contribute to regulating checkpoints of the two oscillators. CONCLUSIONS: Our approach underlined the potential key role of the core clock protein NR1D1 in regulating cell cycle progression. We predicted that its activity influences negatively the progression of the cell cycle from phase G2 to M. This is consistent with the earlier experimental finding that pharmacological activation of NR1D1 inhibits tumour cell proliferation and shows that our approach can identify biologically relevant species in the context of large and complex networks.

Publisher Correction: Reconciling qualitative, abstract, and scalable modeling of biological networks.

An amendment to this paper has been published and can be accessed via a link at the top of the paper.

Reconciling qualitative, abstract, and scalable modeling of biological networks.

Predicting biological systems' behaviors requires taking into account many molecular and genetic elements for which limited information is available past a global knowledge of their pairwise interactions. Logical modeling, notably with Boolean Networks (BNs), is a well-established approach that enables reasoning on the qualitative dynamics of networks. Several dynamical interpretations of BNs have been proposed. The synchronous and (fully) asynchronous ones are the most prominent, where the value of either all or only one component can change at each step. Here we prove that, besides being costly to analyze, these usual interpretations can preclude the prediction of certain behaviors observed in quantitative systems. We introduce an execution paradigm, the Most Permissive Boolean Networks (MPBNs), which offers the formal guarantee not to miss any behavior achievable by a quantitative model following the same logic. Moreover, MPBNs significantly reduce the complexity of dynamical analysis, enabling to model genome-scale networks.

Algorithms for the Sequential Reprogramming of Boolean Networks.

Cellular reprogramming, a technique that opens huge opportunities in modern and regenerative medicine, heavily relies on identifying key genes to perturb. Most of the existing computational methods for controlling which attractor (steady state) the cell will reach focus on finding mutations to apply to the initial state. However, it has been shown, and is proved in this article, that waiting between perturbations so that the update dynamics of the system prepares the ground, allows for new reprogramming strategies. To identify such sequential perturbations, we consider a qualitative model of regulatory networks, and rely on Binary Decision Diagrams to model their dynamics and the putative perturbations. Our method establishes a set identification of sequential perturbations, whether permanent (mutations) or only temporary, to achieve the existential or inevitable reachability of an arbitrary state of the system. We apply an implementation for temporary perturbations on models from the literature, illustrating that we are able to derive sequential perturbations to achieve trans-differentiation.

Computational discovery of dynamic cell line specific Boolean networks from multiplex time-course data.

Protein signaling networks are static views of dynamic processes where proteins go through many biochemical modifications such as ubiquitination and phosphorylation to propagate signals that regulate cells and can act as feed-back systems. Understanding the precise mechanisms underlying protein interactions can elucidate how signaling and cell cycle progression occur within cells in different diseases such as cancer. Large-scale protein signaling networks contain an important number of experimentally verified protein relations but lack the capability to predict the outcomes of the system, and therefore to be trained with respect to experimental measurements. Boolean Networks (BNs) are a simple yet powerful framework to study and model the dynamics of the protein signaling networks. While many BN approaches exist to model biological systems, they focus mainly on system properties, and few exist to integrate experimental data in them. In this work, we show an application of a method conceived to integrate time series phosphoproteomic data into protein signaling networks. We use a large-scale real case study from the HPN-DREAM Breast Cancer challenge. Our efficient and parameter-free method combines logic programming and model-checking to infer a family of BNs from multiple perturbation time series data of four breast cancer cell lines given a prior protein signaling network. Because each predicted BN family is cell line specific, our method highlights commonalities and discrepancies between the four cell lines. Our models have a Root Mean Square Error (RMSE) of 0.31 with respect to the testing data, while the best performant method of this HPN-DREAM challenge had a RMSE of 0.47. To further validate our results, BNs are compared with the canonical mTOR pathway showing a comparable AUROC score (0.77) to the top performing HPN-DREAM teams. In addition, our approach can also be used as a complementary method to identify erroneous experiments. These results prove our methodology as an efficient dynamic model discovery method in multiple perturbation time course experimental data of large-scale signaling networks. The software and data are publicly available at https://github.com/misbahch6/caspo-ts.

The CoLoMoTo Interactive Notebook: Accessible and Reproducible Computational Analyses for Qualitative Biological Networks.

Analysing models of biological networks typically relies on workflows in which different software tools with sensitive parameters are chained together, many times with additional manual steps. The accessibility and reproducibility of such workflows is challenging, as publications often overlook analysis details, and because some of these tools may be difficult to install, and/or have a steep learning curve. The CoLoMoTo Interactive Notebook provides a unified environment to edit, execute, share, and reproduce analyses of qualitative models of biological networks. This framework combines the power of different technologies to ensure repeatability and to reduce users' learning curve of these technologies. The framework is distributed as a Docker image with the tools ready to be run without any installation step besides Docker, and is available on Linux, macOS, and Microsoft Windows. The embedded computational workflows are edited with a Jupyter web interface, enabling the inclusion of textual annotations, along with the explicit code to execute, as well as the visualization of the results. The resulting notebook files can then be shared and re-executed in the same environment. To date, the CoLoMoTo Interactive Notebook provides access to the software tools GINsim, BioLQM, Pint, MaBoSS, and Cell Collective, for the modeling and analysis of Boolean and multi-valued networks. More tools will be included in the future. We developed a Python interface for each of these tools to offer a seamless integration in the Jupyter web interface and ease the chaining of complementary analyses.

Prediction of Mutations to Control Pathways Enabling Tumor Cell Invasion with the CoLoMoTo Interactive Notebook (Tutorial).

Boolean and multi-valued logical formalisms are increasingly used to model complex cellular networks. To ease the development and analysis of logical models, a series of software tools have been proposed, often with specific assets. However, combining these tools typically implies a series of cumbersome software installation and model conversion steps. In this respect, the CoLoMoTo Interactive Notebook provides a joint distribution of several logical modeling software tools, along with an interactive web Python interface easing the chaining of complementary analyses. Our computational workflow combines (1) the importation of a GINsim model and its display, (2) its format conversion using the Java library BioLQM, (3) the formal prediction of mutations using the OCaml software Pint, (4) the model checking using the C++ software NuSMV, (5) quantitative stochastic simulations using the C++ software MaBoSS, and (6) the visualization of results using the Python library matplotlib. To illustrate our approach, we use a recent Boolean model of the signaling network controlling tumor cell invasion and migration. Our model analysis culminates with the prediction of sets of mutations presumably involved in a metastatic phenotype.

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.

Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming.

BACKGROUND: Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour. METHODS: In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations. RESULTS: We illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach. CONCLUSIONS: Our method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at http://loicpauleve.name/pint.

The Redox Status of Cancer Cells Supports Mechanisms behind the Warburg Effect.

To better understand the energetic status of proliferating cells, we have measured the intracellular pH (pHi) and concentrations of key metabolites, such as adenosine triphosphate (ATP), nicotinamide adenine dinucleotide (NAD), and nicotinamide adenine dinucleotide phosphate (NADP) in normal and cancer cells, extracted from fresh human colon tissues. Cells were sorted by elutriation and segregated in different phases of the cell cycle (G0/G1/S/G2/M) in order to study their redox (NAD, NADP) and bioenergetic (ATP, pHi) status. Our results show that the average ATP concentration over the cell cycle is higher and the pHi is globally more acidic in normal proliferating cells. The NAD+/NADH and NADP+/NADPH redox ratios are, respectively, five times and ten times higher in cancer cells compared to the normal cell population. These energetic differences in normal and cancer cells may explain the well-described mechanisms behind the Warburg effect. Oscillations in ATP concentration, pHi, NAD+/NADH, and NADP+/NADPH ratios over one cell cycle are reported and the hypothesis addressed. We also investigated the mitochondrial membrane potential (MMP) of human and mice normal and cancer cell lines. A drastic decrease of the MMP is reported in cancer cell lines compared to their normal counterparts. Altogether, these results strongly support the high throughput aerobic glycolysis, or Warburg effect, observed in cancer cells.

Reconstructing dynamic molecular states from single-cell time series.

The notion of state for a system is prevalent in the quantitative sciences and refers to the minimal system summary sufficient to describe the time evolution of the system in a self-consistent manner. This is a prerequisite for a principled understanding of the inner workings of a system. Owing to the complexity of intracellular processes, experimental techniques that can retrieve a sufficient summary are beyond our reach. For the case of stochastic biomolecular reaction networks, we show how to convert the partial state information accessible by experimental techniques into a full system state using mathematical analysis together with a computational model. This is intimately related to the notion of conditional Markov processes and we introduce the posterior master equation and derive novel approximations to the corresponding infinite-dimensional posterior moment dynamics. We exemplify this state reconstruction approach using both in silico data and single-cell data from two gene expression systems in Saccharomyces cerevisiae, where we reconstruct the dynamic promoter and mRNA states from noisy protein abundance measurements.

Qualitative dynamics semantics for SBGN process description.

BACKGROUND: Qualitative dynamics semantics provide a coarse-grain modeling of networks dynamics by abstracting away kinetic parameters. They allow to capture general features of systems dynamics, such as attractors or reachability properties, for which scalable analyses exist. The Systems Biology Graphical Notation Process Description language (SBGN-PD) has become a standard to represent reaction networks. However, no qualitative dynamics semantics taking into account all the main features available in SBGN-PD had been proposed so far. RESULTS: We propose two qualitative dynamics semantics for SBGN-PD reaction networks, namely the general semantics and the stories semantics, that we formalize using asynchronous automata networks. While the general semantics extends standard Boolean semantics of reaction networks by taking into account all the main features of SBGN-PD, the stories semantics allows to model several molecules of a network by a unique variable. The obtained qualitative models can be checked against dynamical properties and therefore validated with respect to biological knowledge. We apply our framework to reason on the qualitative dynamics of a large network (more than 200 nodes) modeling the regulation of the cell cycle by RB/E2F. CONCLUSION: The proposed semantics provide a direct formalization of SBGN-PD networks in dynamical qualitative models that can be further analyzed using standard tools for discrete models. The dynamics in stories semantics have a lower dimension than the general one and prune multiple behaviors (which can be considered as spurious) by enforcing the mutual exclusiveness between the activity of different nodes of a same story. Overall, the qualitative semantics for SBGN-PD allow to capture efficiently important dynamical features of reaction network models and can be exploited to further refine them.

Necessary and sufficient conditions for protocell growth.

We consider a generic protocell model consisting of any conservative chemical reaction network embedded within a membrane. The membrane results from the self-assembly of a membrane precursor and is semi-permeable to some nutrients. Nutrients are metabolized into all other species including the membrane precursor, and the membrane grows in area and the protocell in volume. Faithful replication through cell growth and division requires a doubling of both cell volume and surface area every division time (thus leading to a periodic surface area-to-volume ratio) and also requires periodic concentrations of the cell constituents. Building upon these basic considerations, we prove necessary and sufficient conditions pertaining to the chemical reaction network for such a regime to be met. A simple necessary condition is that every moiety must be fed. A stronger necessary condition implies that every siphon must be either fed, or connected to species outside the siphon through a pass reaction capable of transferring net positive mass into the siphon. And in the case of nutrient uptake through passive diffusion and of constant surface area-to-volume ratio, a sufficient condition for the existence of a fixed point is that every siphon be fed. These necessary and sufficient conditions hold for any chemical reaction kinetics, membrane parameters or nutrient flux diffusion constants.

Cell cycle progression is regulated by intertwined redox oscillators.

The different phases of the eukaryotic cell cycle are exceptionally well-preserved phenomena. DNA decompaction, RNA and protein synthesis (in late G1 phase) followed by DNA replication (in S phase) and lipid synthesis (in G2 phase) occur after resting cells (in G0) are committed to proliferate. The G1 phase of the cell cycle is characterized by an increase in the glycolytic metabolism, sustained by high NAD+/NADH ratio. A transient cytosolic acidification occurs, probably due to lactic acid synthesis or ATP hydrolysis, followed by cytosolic alkalinization. A hyperpolarized transmembrane potential is also observed, as result of sodium/potassium pump (NaK-ATPase) activity. During progression of the cell cycle, the Pentose Phosphate Pathway (PPP) is activated by increased NADP+/NADPH ratio, converting glucose 6-phosphate to nucleotide precursors. Then, nucleic acid synthesis and DNA replication occur in S phase. Along with S phase, unpublished results show a cytosolic acidification, probably the result of glutaminolysis occurring during this phase. In G2 phase there is a decrease in NADPH concentration (used for membrane lipid synthesis) and a cytoplasmic alkalinization occurs. Mitochondria hyperfusion matches the cytosolic acidification at late G1/S transition and then triggers ATP synthesis by oxidative phosphorylation. We hypothesize here that the cytosolic pH may coordinate mitochondrial activity and thus the different redox cycles, which in turn control the cell metabolism.

Dynamical properties of Discrete Reaction Networks.

Reaction networks are commonly used to model the dynamics of populations subject to transformations that follow an imposed stoichiometry. This paper focuses on the efficient characterisation of dynamical properties of Discrete Reaction Networks (DRNs). DRNs can be seen as modeling the underlying discrete nondeterministic transitions of stochastic models of reaction networks. In that sense, a proof of non-reachability in a given DRN has immediate implications for any concrete stochastic model based on that DRN, independent of the choice of kinetic laws and constants. Moreover, if we assume that stochastic kinetic rates are given by the mass-action law (or any other kinetic law that gives non-vanishing probability to each reaction if the required number of interacting substrates is present), then reachability properties are equivalent in the two settings. The analysis of two types of global dynamical properties of DRNs is addressed: irreducibility, i.e., the ability to reach any discrete state from any other state; and recurrence, i.e., the ability to return to any initial state. Our results consider both the verification of such properties when species are present in a large copy number, and in the general case. The necessary and sufficient conditions obtained involve algebraic conditions on the network reactions which in most cases can be verified using linear programming. Finally, the relationship of DRN irreducibility and recurrence with dynamical properties of stochastic and continuous models of reaction networks is discussed.