Finding identifiable parameter combinations in nonlinear ODE models and the rational reparameterization of their input–output equations

When examining the structural identifiability properties of dynamic system models, some parameters can take on an infinite number of values and yet yield identical input–output data. These parameters and the model are then said to be unidentifiable. Finding identifiable combinations of parameters with which to reparameterize the model provides a means for quantitatively analyzing the model and computing solutions in terms of the combinations. In this paper, we revisit and explore the properties of an algorithm for finding identifiable parameter combinations using Gröbner Bases and prove useful theoretical properties of these parameter combinations. We prove a set of M algebraically independent identifiable parameter combinations can be found using this algorithm and that there exists a unique rational reparameterization of the input–output equations over these parameter combinations. We also demonstrate application of the procedure to a nonlinear biomodel.

► We prove some theoretical results relating to our previous Math. Biosci. paper. ► We demonstrate our algorithm on two new examples. ► We show that other methods to find identifiable combinations do not always work well.