Search bioRxiv⌕ Search

bioRxiv · 10.1101/2025.05.23.655795

Multiscale Probabilistic Modeling: A Bayesian Approach to Augment Mechanistic Models of Cell Signaling with Machine-Learning Predictions of Binding Affinity

Abstract

Computational models in systems biology are often underdetermined--that is, there is little data relative to the complexity and size of the model. The lack of data is primarily due to limits in our ability to observe specific biological systems and restricts the utility of computational models. However, there are a growing number of experimental databases in biology. While these databases provide more observations, they often do not have observations that match the system of interest exactly. For example, database measurements might be collected at different experimental conditions or on a different scale compared to the system of interest. Here, we investigate what information can be gleaned from generalizing databases across these differences in the context of modeling a specific system - cell signaling. Ultimately, our goal is to better determine models of specific systems, thereby increasing their utility. To do this, we propose a novel, multiscale, probabilistic framework. We use this framework to integrate measurements of protein structure from the Protein Data Bank and measurements of amino acid sequence from the Universal Protein Resource into the parameter inference of cell signaling models. Then, we quantify exactly what information is gained from these measurements when modeling cell signaling. We choose to investigate the utility of these databases in the context of dynamic cell signaling models because experimental measurements of the variables of interest, protein dynamics, are still quite limited. We find that we can successfully integrate measurements from these databases to significantly improve parameter estimation of signaling models. The impact of sequence and structure measurements on model predictions depends on the sensitivity of the prediction to perturbations in the parameter values. Overall, this study demonstrates that measurements of protein structure and amino acid sequence can be leveraged to better inform parameters in models of cell signaling. Author SummaryComputational models of cell signaling have provided mechanistic insights into complex biological systems, including in physiological and disease settings. Accurate and predictive modeling critically depends on the precise estimation of model parameters, which is often hindered by the limited availability of experimental data. In this study, we present a novel multiscale probabilistic inference framework that broadens the scope of data types that can be leveraged for parameter estimation for models of cell signaling. The framework integrates a machine learning pipeline with a generalizable parameter inference approach, enabling the use of experimental data across scales. Specifically, we demonstrate that incorporating protein amino acid sequence and 3D structural data enhances parameter estimation compared to traditional measurements such as protein concentrations over time. Improving parameter estimation increases the robustness and applicability of cell signaling models. Ultimately, our framework facilitates use of a broader range of data and supports the development of predictive computational models that increase our understanding of cell signaling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Huber, H. A., Finley, S. D.. 2025-05-23. Multiscale Probabilistic Modeling: A Bayesian Approach to Augment Mechanistic Models of Cell Signaling with Machine-Learning Predictions of Binding Affinity. https://doi.org/10.1101/2025.05.23.655795

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

Parsimonious Creatures: Building Gene Regulatory Networks Robust to Somatic Evolution

For early multicellular life to have formed and maintained cellular organization, preventing loss of controlled cell replication due to somatic evolution was of critical importance, and remains important to this day for control of cancer. We study how gene regulatory networks (GRNs) can be designed to slow the divergence of somatic clonal lineages in the context of early multicellular life. We model the mutation of GRNs within simplified 12-celled organisms we term "parsimonious creatures", who must replicate from a single cell to 12 cells and then prevent replication past 12 cells to maximize fitness. We found two minimal motifs can achieve these goals, but both are prone to breakdown through somatic evolution: The feedforward motif, which is loosely regulating but relatively robust, and the simple step motif, which uses strong interactions and feedback to form memoryless ultrasensitivity, but is fragile. These simple motifs may be duplicated to form redundant networks via one of two structures: averaging redundancy, which averages multiple sources of information, and min redundancy, which adopts the most conservative source. Averaging redundancy uniformly slows somatic evolution, while min redundancy stalls somatic evolution until neutral mutations accumulate. Either may be superior dependent on life history. However, averaging redundancy slowly increases fitness as the network becomes larger, but large min redundancy networks eventually become "paralyzed", increasing the probability of senescence and reducing fitness. These GRN designs are idealized, yet provide imperfect solutions with fundamental tradeoffs, offering insight as to why somatic evolution remains an incompletely solved problem for multicellular life.

systems biology↗

Homogeneous network inference for subtype-stratified master regulator analysis in cancer

Master-regulator analysis of 34 TCGA tumour cohorts (cancer x molecular subtype; n between 27 and 562 tumours) requires one regulatory network per cohort. Mutual-information (MI) networks inferred with ARACNe3 are the usual choice, but they are not available for the smallest cohorts; filling the gap with correlation networks would mix two methods inside the very comparison between subtypes that the analysis is meant to make. We therefore infer every network with a single procedure, fixed-size Spearman regulons (FSR): rank correlation between regulator and target, a fixed effect-size threshold rho >= 0.2, the per-target data-processing-inequality (DPI) pruning implemented in corto, bootstrap support, and truncation to the 100 best-supported targets per regulator. We quantify what this choice concedes and what it provides, labelling each claim as a standard result, a heuristic, or an empirical result. Rank correlation is more powerful than the MI estimators we simulated for n < 200 but cannot see non-monotone dependence, which in a synthetic worst case costs at most about 0.05-0.10 of the master regulators recovered; the per-target DPI is a heuristic with a measurable disagreement rate with the MI-based one; and pairwise dependence is not direct interaction, for MI and correlation alike. Where both methods are feasible (n >= 95) they overlap in 0.7 of the top-20 regulators, the same as two filterings of the same ARACNe3 network, although the rank correlation of the full score vector shows a measurable method effect in the tail. Subsampling large real cohorts indicates that networks inferred from fewer than 60 tumours do not reliably reproduce their own cohort's master regulators, that 60-100 is a grey zone, and that a cancer-wide network does not rescue small subtypes. We present FSR as an adequate and uniform choice for multi-cohort analysis, not as a statistically superior one.

systems biology↗

Low-fidelity simulator selection for multi-fidelity inference of epithelial vertex models

Vertex models link cell division, neighbour exchange, and intercellular forces to epithelial tissue form through parameters such as junctional line tension and perimeter contractility. Bayesian inference of these parameters from data quantifies their uncertainty, but for stochastic models of proliferating tissues it requires many costly simulations. Multi-fidelity simulation-based inference reduces this cost by training on many runs of a cheaper, less accurate ('low-fidelity') simulator before refining with a few full ('high-fidelity') runs. Low-fidelity versions can be constructed in several ways, for example by stopping simulations early, coarsening the timestep, or averaging fewer replicates, but it is unclear which to choose before committing to costly training. To address this, we introduce PRISM (Paired Ranking Index for Simulator Matching), a screen that compares each candidate with the full simulator on paired runs, scoring agreement in cell-packing statistics against cost. For a vertex model of a proliferating tissue, PRISM flags stopping early as unreliable before training; once trained, this choice can produce confidently wrong parameter estimates. By contrast, a coarser timestep, within the range tested, is cheap and accurate; while fewer replicates are accurate but too costly. Using a screened low-fidelity simulator, multi-fidelity inference outperforms approximate Bayesian computation and neural-network inference trained on full simulations alone, at matched cost and with well-calibrated uncertainty. The same pattern recurs for a second vertex model fitted to published Drosophila pupal-wing imaging data, although there stopping halfway proves safe. Together, our findings suggest that which approximations are safe depends on the model, and that screening them before training makes multi-fidelity inference of tissue mechanics practical.

systems biology↗