REVIEW 1 cited by
More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Structural global parameter identifiability indicates whether one can determine a parameter's value from given inputs and outputs in the absence of noise. If a given model has parameters for which there may be infinitely many values, such parameters are called non-identifiable. We present a procedure for accelerating a global identifiability query by eliminating algebraically independent non-identifiable parameters. Our proposed approach significantly improves performance across different computer algebra frameworks.
Forward citations
Cited by 1 Pith paper
-
Simple generators of rational function fields
A new randomized algorithm computes simpler generators of rational function fields by interpolating only low-degree Gröbner coefficients and searching for low-degree polynomial elements.
Discussion (0). Continue with ORCID to comment.