Search arXivSearch

arXiv · 2407.02771

Examining the impact of forcing function inputs on structural identifiability

Abstract

For mathematical and experimental ease, models with time varying parameters are often simplified to assume constant parameters. However, this simplification can potentially lead to identifiability issues (lack of uniqueness of parameter estimates). Methods have been developed to algebraically and numerically determine the identifiability of a model, as well as resolve identifiability issues. This specific type of simplification presents an alternate opportunity to instead use this information to resolve the unidentifiability. Given that re-parameterizing, collecting more data, and adding inputs can be potentially costly or impractical, this could present new alternatives. We present a method for resolving unidentifiability in a system by introducing a new data stream correlated with a parameter of interest. First, we demonstrate how and when non-constant input data can be introduced into any rational function ODE system without worsening the model identifiability. Then, we prove when these input functions improve structural and potentially also practical identifiability for a given model and relevant data. By utilizing pre-existing data streams, these methods can potentially reduce experimental costs, while still answering key questions. By connecting mathematical proofs to application, our framework removes guesswork from when, where, and how researchers can best introduce new data to improve model outcomes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jessica R Conrad, James M Hyman, Marisa C Eisenberg. 2026-03-20. Examining the impact of forcing function inputs on structural identifiability. https://arxiv.org/abs/2407.02771

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

KEEP EXPLORING

Related papers

Retracing the Process of Translation: Proteome-wide mapping of stable transcriptomic predictors of protein abundance in cancer cell lines

Understanding the relationship between gene expression and protein abundance is central to molecular and systems biology. While gene expression reflects transcriptional activity, proteins are the functional molecules that determine cellular phenotypes. However, numerous post-transcriptional and translational regulatory layers complicate this relationship, and prior studies have reported only weak to moderate correlations between RNA and protein levels. Predicting protein abundance from transcriptomic data remains challenging, but it is a valuable goal for biological insight, especially when proteomic data is limited or unavailable. In this study, we applied a large-scale, Ridge regression-based feature selection strategy to identify predictive gene expression features for each of 8,423 proteins across 940 cancer cell lines. To our knowledge, this is the first work to perform such comprehensive protein-wise feature selection at this scale. Our analysis revealed both globally predictive and context-specific gene features. These included biologically meaningful modules such as immune-related genes, HOX transcription factor targets, and cytoskeletal components. The models identified stable candidate gene-protein associations that remained interpretable at the level of individual proteins and recurrent transcriptomic predictor patterns. Our approach enables interpretable modeling of protein expression from transcriptomic data and provides insight into transcriptomic features associated with protein abundance. This framework may support hypothesis generation, protein imputation in incomplete datasets, and deeper understanding of post-transcriptional regulation in cancer biology.

q-bio.QM

Surf_2_Volume: a workflow for converting CIFTI parcellations to NIfTI volume space

Many neuroimaging programs require volumetric NIfTI files and cannot directly use parcellations stored in CIFTI format. We developed Surf_2_Volume, a workflow that uses Connectome Workbench, FreeSurfer, AFNI/SUMA, neuromaps, and Python to convert categorical CIFTI parcellations into NIfTI volumes. Cortical labels are transferred through fsaverage to a surface representation of the MNI152 template and assigned to voxels within a smoothed cortical ribbon mask. A threshold controls how much of this mask is included. We tested twelve thresholds with the Schaefer2018 atlas with 100 parcels and 7 networks, which is available as both an fsLR representation and a published FSL MNI152 1 mm volume. We compared each converted volume with the published reference and with standard Workbench ribbon and nearest-vertex mappings. At threshold 0.05, Surf_2_Volume had higher scores on the two measures of parcel overlap, Dice and Jaccard, than the best Workbench setting (0.729 vs. 0.709 and 0.580 vs. 0.556, respectively). It also left fewer reference voxels unlabeled (11.88% vs. 20.57%) and assigned fewer labels outside the reference (9.43% vs. 11.22%). Among the tested Surf_2_Volume thresholds, 0.05 also produced the lowest average parcel volume distortion. Surf_2_Volume provides a tunable and reproducible workflow for generating volumetric atlases from CIFTI parcellations when volume-based analyses are required.

q-bio.QM

UQSA -- An R-Package for Uncertainty Quantification and Sensitivity Analysis for Biochemical Reaction Network Models

Biochemical reaction models describing subcellular processes generally come with a large uncertainty. To be able to account for this during the modeling process, we have developed the R-package UQSA, performing uncertainty quantification and sensitivity analysis in an integrated fashion. UQSA is designed for fast sampling of complicated multi-dimensional parameter distributions, using efficient Markov chain Monte Carlo (MCMC) sampling techniques and Vine-copulas to model complicated joint distributions. We perform MCMC sampling both from stochastic and deterministic models, in either likelihood-free or likelihood-based settings. In the likelihood-free case, we use Approximate Bayesian Computation (ABC), while for likelihood-based sampling we provide different algorithms, including the fast geometry-informed algorithm SMMALA (Simplified Manifold Metropolis-Adjusted Langevin Algorithm). The uncertainty quantification can be followed by a variance decomposition-based global sensitivity analysis. We are aiming for biochemical models, but UQSA can be used for any type of reaction networks. VineCopula: The use of Vine-copulas allows us to describe, evaluate, and sample from complicated parameter distributions, as well as adding new datasets in a sequential manner without redoing the previous parameter fit. The code is written in R, with C as a back-end to improve speed. We use the SBtab table format for Systems Biology projects for the model description as well as the experimental data. An event system allows the user to model complicated transient input, common within, e.g., neuroscience. UQSA has an extensive documentation with several examples describing different types of models and data. The code has been tested on up to 2000 cores on several nodes on a computing cluster, but we also include smaller examples that can be run on a laptop. Source code: https://github.com/icpm-kth/uqsa

q-bio.QM