bioRxiv Science⌕ Search

bioRxiv · 10.1101/2024.10.28.620577

Fitting and comparison of calcium-calmodulin kinetic schemes to a common data set using non-linear mixed effects modelling

Abstract

Calmodulin is a calcium binding protein that is essential in calcium signalling in the brain. There are many computational models of calcium-calmodulin binding that capture various calmodulin features. However, existing models have generally been fit to different data sets, with some publications not reporting their training and validation performance. Moreover, there is no model comparison using a common benchmark data set as is common practice in other modeling domains. Finally, some calmodulin models have been fit as a part of a larger kinetic scheme, which may have resulted in parameters being underdetermined. We address these three limitations of previous models by fitting the published calcium-calmodulin schemes to a common calcium-calmodulin data set comprising of equlibrium data from Shifman et al. and dynamical data from Faas et al. Due to technical limitations, the amount of uncaged calcium in Faas et al. data could not be predicted with certainty. To find good parameter fits, despite this uncertainty, we used non-linear mixed effects modelling as implemented in the Pumas.jl package. The Akaike information criterion values for our reaction rates were significantly lower than for the published parameters, indicating that the published parameters are suboptimal. Moreover, there were significant differences in calmodulin activation, both between the schemes and between our reaction rate and those previously published. A kinetic scheme with independent lobes and unique, rather than identical, binding sites fit the data best. Our results support two hypotheses: (1) partially bound calmodulin is important in cellular signalling; (2) calcium binding sites within a calmodulin lobe are kinetically distinct rather than identical. We conclude that more attention should be given to validation and comparison of models of individual molecules. Author summaryLearning and memory depend on changes in synapses, the connections between nerve cells. To understand how learning and memory work, it is important to understand how the proteins involved in these changes are regulated. Computational modelling of biochemical reactions has been used to understand the regulation processes involved in learning and memory. However, computational models often rely on simplifications of biochemical reaction schemes, and it can be difficult to tell which simplifications are "the best", i.e. capture important aspects of a proteins behaviour. It is also difficult to estimate the best model parameters, such as binding reaction rates or binding strengths. Modellers often base their estimates on known experimental results, but often not in a structured way. We examine and compare a variety of computational models of calmodulin, a protein necessary for changes in synaptic strength. We apply a new approach to infer the model parameters that best fit two published datasets, and compare our parameters to previously published ones. We find that some simplified reaction schemes are more successful than others in capturing the activation pattern of calmodulin. We also find that the parameter sets found through our approach outperform previously published parameter sets in fitting the experimental data.

Source connections

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Linkevicius, D., Chadwick, A., Faas, G. C., Stefan, M. I., Sterratt, D. C.. 2024-10-31. Fitting and comparison of calcium-calmodulin kinetic schemes to a common data set using non-linear mixed effects modelling. https://doi.org/10.1101/2024.10.28.620577

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↗