bioRxiv Science⌕ Search

bioRxiv · 10.1101/2025.01.16.633337

Using SED-ML for reproducible curation: Verifying BioModels across multiple simulation engines

Abstract

The BioModels Repository contains over 1000 manually curated mechanistic models from published literature, most often encoded in the Systems Biology Markup Language (SBML). This community-based standard formally specifies each model, but does not describe the computational experimental conditions to run a simulation. Therefore, it can be challenging to reproduce any figure or result from a publication with an SBML model alone. The Simulation Experiment Description Markup Language (SED-ML) provides a solution: a standard way to specify exactly how to run an experiment corresponding to a specific figure or result. BioModels was established years before SED-ML, and both systems evolved over time, both in content and acceptance. Hence, only about half of the entries in BioModels contained SED-ML files, and these files reflected the version of SED-ML that was available at the time. Additionally, almost all of these SED-ML files had at least one minor mistake that made them invalid. To make these models and their results more reproducible, we report here on our work updating, correcting and generating new SED-ML files for 1055 curated mechanistic models in BioModels. In addition, because SED-ML is implementation-independent, it can be used for verification, demonstrating that results hold across multiple simulation engines. We tested, corrected, and improved over 450 existing SED-ML files in the BioModels database, and created basic files for the rest of the entries. Then, we used a wrapper architecture for interpreting SED-ML, and report verification results across five different ODE-based biosimulation engines, after further improving the models, the wrappers, and the engines themselves. Our work with SED-ML and the BioModels collection aims to improve the utility of these models by making them more reproducible and credible. Improved reproducibility means these models are now even more fit for re-use, such as in new investigations and as components of multiscale models. Author summaryReproducing computationally-derived scientific results seems like it should be straightforward, but is often elusive. Code is lost, file formats change, and knowledge of what was done is only partially recorded and/or forgotten. Model repositories such as BioModels address this failing in the Systems Biology domain by encoding models in a standard format that can reproduce a figure from the paper from which it was drawn. Here, we delved into the BioModels repository to create and correct the instructions on what to do with every curated model, and then tested those instructions on a variety of simulation platforms, allowing us to find and correct issues with the platforms and the simulators themselves. Not only did this improve the BioModels repository, but also improved the infrastructure necessary to run these verification comparisons in the future, and improved the fitness of the models for re-use by other researchers.

Source connections

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Smith, L. P., Malik-Sherif, R. S., Nguyen, T. V. N., Hermjakob, H., Karr, J., Shaikh, B., Drescher, L., Moraru, I. I., Schaff, J., Agmon, E., Patrie, A., Blinov, M. L., Hellerstein, J., May, E., Nickerson, D., Gennari, J., Sauro, H.. 2025-01-20. Using SED-ML for reproducible curation: Verifying BioModels across multiple simulation engines. https://doi.org/10.1101/2025.01.16.633337

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↗