Identifiability and distinguishability testing via computer algebra

Testing structural identifiability by a simple scaling method

Successful mathematical modeling of biological processes relies on the expertise of the modeler to capture the essential mechanisms in the process at hand and on the ability to extract useful information from empirical data. A model is said to be structurally unidentifiable, if different quantitative sets of parameters provide the same observable outcome. This is typical (but not exclusive) of partially observed problems in which only a few variables can be experimentally measured. Most of the available methods to test the structural identifiability of a model are either too complex mathematically for the general practitioner to be applied, or require involved calculations or numerical computation for complex non-linear models. In this work, we present a new analytical method to test structural identifiability of models based on ordinary differential equations, based on the invariance of the equations under the scaling transformation of its parameters. The method is based on rigorous mathematical results but it is easy and quick to apply, even to test the identifiability of sophisticated highly non-linear models. We illustrate our method by example and compare its performance with other existing methods in the literature.

Inference of complex biological networks: distinguishability issues and optimization-based solutions

Background

The inference of biological networks from high-throughput data has received huge attention during the last decade and can be considered an important problem class in systems biology. However, it has been recognized that reliable network inference remains an unsolved problem. Most authors have identified lack of data and deficiencies in the inference algorithms as the main reasons for this situation.

Results

We claim that another major difficulty for solving these inference problems is the frequent lack of uniqueness of many of these networks, especially when prior assumptions have not been taken properly into account. Our contributions aid the distinguishability analysis of chemical reaction network (CRN) models with mass action dynamics. The novel methods are based on linear programming (LP), therefore they allow the efficient analysis of CRNs containing several hundred complexes and reactions. Using these new tools and also previously published ones to obtain the network structure of biological systems from the literature, we find that, often, a unique topology cannot be determined, even if the structure of the corresponding mathematical model is assumed to be known and all dynamical variables are measurable. In other words, certain mechanisms may remain undetected (or they are falsely detected) while the inferred model is fully consistent with the measured data. It is also shown that sparsity enforcing approaches for determining 'true' reaction structures are generally not enough without additional prior information.

Conclusions

The inference of biological networks can be an extremely challenging problem even in the utopian case of perfect experimental information. Unfortunately, the practical situation is often more complex than that, since the measurements are typically incomplete, noisy and sometimes dynamically not rich enough, introducing further obstacles to the structure/parameter estimation process. In this paper, we show how the structural uniqueness and identifiability of the models can be guaranteed by carefully adding extra constraints, and that these important properties can be checked through appropriate computation methods.

ON IDENTIFIABILITY OF NONLINEAR ODE MODELS AND APPLICATIONS IN VIRAL DYNAMICS

Ordinary differential equations (ODE) are a powerful tool for modeling dynamic processes with wide applications in a variety of scientific fields. Over the last 2 decades, ODEs have also emerged as a prevailing tool in various biomedical research fields, especially in infectious disease modeling. In practice, it is important and necessary to determine unknown parameters in ODE models based on experimental data. Identifiability analysis is the first step in determing unknown parameters in ODE models and such analysis techniques for nonlinear ODE models are still under development. In this article, we review identifiability analysis methodologies for nonlinear ODE models developed in the past one to two decades, including structural identifiability analysis, practical identifiability analysis and sensitivity-based identifiability analysis. Some advanced topics and ongoing research are also briefly reviewed. Finally, some examples from modeling viral dynamics of HIV, influenza and hepatitis viruses are given to illustrate how to apply these identifiability analysis methods in practice.

Structural identifiability of polynomial and rational systems

Since analysis and simulation of biological phenomena require the availability of their fully specified models, one needs to be able to estimate unknown parameter values of the models. In this paper we deal with identifiability of parametrizations which is the property of one-to-one correspondence of parameter values and the corresponding outputs of the models. Verification of identifiability of a parametrization precedes estimation of numerical values of parameters, and thus determination of a fully specified model of a considered phenomenon. We derive necessary and sufficient conditions for the parametrizations of polynomial and rational systems to be structurally or globally identifiable. The results are applied to investigate the identifiability properties of the system modeling a chain of two enzyme-catalyzed irreversible reactions. The other examples deal with the phenomena modeled by using Michaelis-Menten kinetics and the model of a peptide chain elongation.

Structural identifiability of a model for the acetic acid fermentation process

Modelling has proved an essential tool for addressing research into biotechnological processes, particularly with a view to their optimization and control. Parameter estimation via optimization approaches is among the major steps in the development of biotechnology models. In fact, one of the first tasks in the development process is to determine whether the parameters concerned can be unambiguously determined and provide meaningful physical conclusions as a result. The analysis process is known as 'identifiability' and presents two different aspects: structural or theoretical identifiability and practical identifiability. While structural identifiability is concerned with model structure alone, practical identifiability takes into account both the quantity and quality of experimental data. In this work, we discuss the theoretical identifiability of a new model for the acetic acid fermentation process and review existing methods for this purpose.

A simplified method to assess structurally identifiable parameters in Monod-based activated sludge models

The first step in the estimation of parameters of models applied for data interpretation should always be an investigation of the identifiability of the model parameters. In this study the structural identifiability of the model parameters of Monod-based activated sludge models (ASM) was studied. In an illustrative example it was assumed that respirometric (dissolved oxygen or oxygen uptake rates) and titrimetric (cumulative proton production) measurements were available for the characterisation of nitrification. Two model structures, including the presence and absence of significant growth for description of long- and short-term experiments, respectively, were considered. The structural identifiability was studied via the series expansion methods. It was proven that the autotrophic yield becomes uniquely identifiable when combined respirometric and titrimetric data are assumed for the characterisation of nitrification. The most remarkable result of the study was, however, that the identifiability results could be generalised by applying a set of ASM1 matrix based generalisation rules. It appeared that the identifiable parameter combinations could be predicted directly based on the knowledge of the process model under study (in ASM1-like matrix representation), the measured variables and the biodegradable substrate considered. This generalisation reduces the time-consuming task of deriving the structurally identifiable model parameters significantly and helps the user to obtain these directly without the necessity to go too deeply into the mathematical background of structural identifiability.

Metabolic isotopomer labeling systems. Part II: structural flux identifiability analysis

Metabolic flux analysis using carbon labeling experiments (CLEs) is an important tool in metabolic engineering where the intracellular fluxes have to be computed from the measured extracellular fluxes and the partially measured distribution of 13C labeling within the intracellular metabolite pools. The relation between unknown fluxes and measurements is described by an isotopomer labeling system (ILS) (see Part I [Math. Biosci. 169 (2001) 173]). Part II deals with the structural flux identifiability of measured ILSs in the steady state. The central question is whether the measured data contains sufficient information to determine the unknown intracellular fluxes. This question has to be decided a priori, i.e. before the CLE is carried out. In structural identifiability analysis the measurements are assumed to be noise-free. A general theory of structural flux identifiability for measured ILSs is presented and several algorithms are developed to solve the identifiability problem. In the particular case of maximal measurement information, a symbolical algorithm is presented that decides the identifiability question by means of linear methods. Several upper bounds of the number of identifiable fluxes are derived, and the influence of the chosen inputs is evaluated. By introducing integer arithmetic this algorithm can even be applied to large networks. For the general case of arbitrary measurement information, identifiability is decided by a local criterion. A new algorithm based on integer arithmetic enables an a priori local identifiability analysis to be performed for networks of arbitrary size. All algorithms have been implemented and flux identifiability is investigated for the network of the central metabolic pathways of a microorganism. Moreover, several small examples are worked out to illustrate the influence of input metabolite labeling and the paradox of information loss due to network simplification.

Identifiability and indistinguishability of nonlinear pharmacokinetic models

Three nonlinear model structures of interest in pharmacokinetics are analyzed to determine whether the unknown, independent, model parameters can be deduced if perfect input-output data were available. This is the problem of identifiability. The method used is based on the local state isomorphism theorem. In certain circumstances, the modeler may be undecided between several model structures and it is then of interest to determine whether different model structures can be distinguished from perfect input-output data. This is the problem of model indistinguishability. The technique used, again based on the local state isomorphism theorem, parallels the similarity transformation approach for linear systems described previously in this journal. The analysis is performed on three two-compartment examples having one linear and one nonlinear (Michaelis-Menten) elimination pathway. In each model there is, on physiological and other grounds, some uncertainty over the precise location (central compartment or peripheral compartment) of one of the elimination pathways.

MAMCAT: an expert system for distinguishing between mammillary and catenary compartmental models

MAMCAT is a user-friendly, interactive, graphics-based PC program for addressing a common compartmental model discrimination problem in the framework of model indistinguishability theory: can mammillary and catenary models of the same order be distinguished from each other? The software is designed to teach the theory and solve specific problems. The user is guided step-by-step through definitions, examples, theory and problem solution. Topological properties are used first to screen out some distinguishable models and thereby reduce the number of candidates for indistinguishability. Transfer function analysis is then used to explore the remaining candidates. Analytical results for up to 5-compartment models are given and a more general algorithm is induced from these results.

Indistinguishability for a class of nonlinear compartmental models

Indistinguishability, as applied to nonlinear compartmental models, is analyzed by means of the local state isomorphism theorem. The method of analysis involves the determination of all local, diffeomorphic transformations connecting the state variables of two models. This is then applied to two two-compartment models, in the first instance with linear eliminations, and then with the addition of eliminations with Michaelis-Menten kinetics. In the nonlinear example, the state transformation turns out to be linear or possibly affine. It is found that the nonlinear analysis could be eased by splitting the state isomorphism equations into those of the initial linear models together with extra equations due to the nonlinearities.

Decomposition-based qualitative experiment design algorithms for a class of compartmental models

Qualitative experiment design, to determine experimental input/output configurations that provide identifiability for specific parameters of interest, can be extremely difficult if the number of unknown parameters and the number of compartments are relatively large. However, the problem can be considerably simplified if the parameters can be divided into several groups for separate identification and the model can be decomposed into smaller submodels for separate experiment design. Model decomposition-based experiment design algorithms are proposed for a practical class of large-scale compartmental models representative of biosystems characterized by multiple input sources and unidirectional interconnectivity among subsystems. The model parameters are divided into three types, each of which is identified consecutively, in three stages, using simpler submodel experiment designs. Several practical examples are presented. Necessary and sufficient conditions for identifiability using the algorithm are also discussed.

Indistinguishability and identifiability analysis of linear compartmental models

Two compartmental model structures are said to be indistinguishable if they have the same input-output properties. In cases in which available a priori information is not sufficient to specify a unique compartmental model structure, indistinguishable model structures may have to be generated and their attributes examined for relevance. An algorithm is developed that, for a given compartmental model, investigates the complete set of models with the same number of compartments and the same input-output structure as the original model, applies geometrical rules necessary for indistinguishable models, and test models meeting the geometrical criteria for equality of transfer functions. Identifiability is also checked in the algorithm. The software consists of three programs. Program 1 determines the number of locally identifiable parameters. Program 2 applies several geometrical rules that eliminate many (generally most) of the candidate models. Program 3 checks the equality between system transfer functions of the original model and models being tested. Ranks of Jacobian matrices and submatrices and other criteria are used to check patterns of moment invariants and local identifiability. Structural controllability and structural observability are checked throughout the programs. The approach was successfully used to corroborate results from examples investigated by others.

Global identifiability of the parameters of nonlinear systems with specified inputs: a comparison of methods

The two methods available for analyzing the global structural identifiability of the parameters of a nonlinear system with a specified input function, the Taylor series approach and the similarity transformation approach, are compared and contrasted through application to three examples. It is shown that, as for linear systems, it is very difficult to predict which of the available methods will result in the least effort for a particular example. The role of modern symbolic manipulation packages in the analysis is assessed. The third example proves intractable using the similarity transformation approach as originally formulated, but the analysis is completed using a reformulation that exploits the polynominal form of the system equations in the example.

A methodology for compartmental model indistinguishability

The problem of constructing all minimal compartmental models that are indistinguishable through input-output knowledge alone from some given model is examined. The main tool in this analysis is a set of geometric properties that can be deduced from input-output knowledge and hence must be equally true in any two indistinguishable models. These properties, together with preservation of the form of the model's transfer function(s), provide an effective means for producing a set of candidate models for indistinguishability.

The problem of model indistinguishability in pharmacokinetics

The problem of model indistinguishability is introduced in the context of linear compartmental models in pharmacokinetics. The two most widely used methods of analyzing model indistinguishability are described. It is shown that as the number of compartments increases, one approach, based on the Laplace transforms of the observations, although conceptually simple, can result in very large numbers of candidate models to be examined for indistinguishability, while the other approach, based on similarity transformations, although systematic, often results in very difficult algebraic expressions. These problems can be eased by the use of some simple geometrical rules, used at the outset of an indistinguishability analysis. The approach is illustrated by application of two 2-compartment drug, 2-compartment metabolite models.

Similarity transformation approach to identifiability analysis of nonlinear compartmental models

Through use of the local state isomorphism theorem instead of the algebraic equivalence theorem of linear systems theory, the similarity transformation approach is extended to nonlinear models, resulting in finitely verifiable sufficient and necessary conditions for global and local identifiability. The approach requires testing of certain controllability and observability conditions, but in many practical examples these conditions prove very easy to verify. In principle the method also involves nonlinear state variable transformations, but in all of the examples presented in the paper the transformations turn out to be linear. The method is applied to an unidentifiable nonlinear model and a locally identifiable nonlinear model, and these are the first nonlinear models other than bilinear models where the reason for lack of global identifiability is nontrivial. The method is also applied to two models with Michaelis-Menten elimination kinetics, both of considerable importance in pharmacokinetics, and for both of which the complicated nature of the algebraic equations arising from the Taylor series approach has hitherto defeated attempts to establish identifiability results for specific input functions.

Structural identifiability of "first-pass" models

This paper considers the structural identifiability of two compartmental models classically used to describe the pharmacokinetics of drugs orally administered and transformed into a metabolite with a first-pass effect at the hepatic level. The simplest model proves not to be globally identifiable even when plasma and urinary measurements of the drug and metabolite concentrations are made. It admits two sets of admissible solutions, so that a priori knowledge must be introduced to distinguish them. The more complex model appears globally identifiable when blood and urine measurements are made.