Proves that checking global identifiability of parametric linear ODE models over reals is NP-hard via equivalence to the injectivity problem.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A tutorial providing a reproducible workflow for global structural identifiability analysis of ODE epidemic models using StructuralIdentifiability.jl, with examples on SEIR variants, vector-borne models, and visual identifiability diagrams.
citing papers explorer
-
A Tutorial on Structural Identifiability of Epidemic Models Using StructuralIdentifiability.jl
A tutorial providing a reproducible workflow for global structural identifiability analysis of ODE epidemic models using StructuralIdentifiability.jl, with examples on SEIR variants, vector-borne models, and visual identifiability diagrams.