Analysis of unique structural identifiability via submodels

The paper presents a sufficient and necessary condition for unique structural identifiability of linear compartmental models. By virtue of this result unique identifiability can be tested via the analysis of some submodels of the original model. Thus, the identifiability problem is reduced step by step to simpler and, finally, to rather trivial problems. In addition to the knowledge of the symbolic expression of the transfer-function matrix, the proposed method of full-rank submodels requires only some numerical rank determinations, and hence allows for a quick and interactive test for unique structural identifiability. The procedure also gives a lower bound on the number of different solutions.     

Unscented Kalman filter with parameter identifiability analysis for the estimation of multiple parameters in kinetic models

In systems biology, experimentally measured parameters are not always available, necessitating the use of computationally based parameter estimation. In order to rely on estimated parameters, it is critical to first determine which parameters can be estimated for a given model and measurement set. This is done with parameter identifiability analysis. A kinetic model of the sucrose accumulation in the sugar cane culm tissue developed by Rohwer et al. was taken as a test case model. What differentiates this approach is the integration of an orthogonal-based local identifiability method into the unscented Kalman filter (UKF), rather than using the more common observability-based method which has inherent limitations. It also introduces a variable step size based on the system uncertainty of the UKF during the sensitivity calculation. This method identified 10 out of 12 parameters as identifiable. These ten parameters were estimated using the UKF, which was run 97 times. Throughout the repetitions the UKF proved to be more consistent than the estimation algorithms used for comparison.     

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.     

Three Ways of Implementing the EM Algorithm when Parameters are not Identifiable

We consider situations where the incomplete nature of the observed data causes identifiability problem. Rather than imposing identifiability constraints on the parameters and then implement the EM algorithm subject to these constraints, we argue that for certain problems, an easier option is to ignore the constraints during the M‐steps of the EM procedure. We also suggest a way of carrying out constrained maximization approximately by using Cox and Wermuth's (1990) method for approximating the constrained maximizers from the unconstrained ones at each M‐step. The simplicity and validity of the unconstrained EM procedure are demonstrated using three examples involving bivariate probit regression, multivariate normal order statistics model and the multinominal distribution. Potential applications to more complicated models are also outlined.     

Structural identifiability of systems biology models: a critical comparison of methods

Analysing the properties of a biological system through in silico experimentation requires a satisfactory mathematical representation of the system including accurate values of the model parameters. Fortunately, modern experimental techniques allow obtaining time-series data of appropriate quality which may then be used to estimate unknown parameters. However, in many cases, a subset of those parameters may not be uniquely estimated, independently of the experimental data available or the numerical techniques used for estimation. This lack of identifiability is related to the structure of the model, i.e. the system dynamics plus the observation function. Despite the interest in knowing a priori whether there is any chance of uniquely estimating all model unknown parameters, the structural identifiability analysis for general non-linear dynamic models is still an open question. There is no method amenable to every model, thus at some point we have to face the selection of one of the possibilities. This work presents a critical comparison of the currently available techniques. To this end, we perform the structural identifiability analysis of a collection of biological models. The results reveal that the generating series approach, in combination with identifiability tableaus, offers the most advantageous compromise among range of applicability, computational complexity and information provided.     

An Effective Automatic Procedure for Testing Parameter Identifiability of HIV/AIDS Models

Realistic HIV models tend to be rather complex and many recent models proposed in the literature could not yet be analyzed by traditional identifiability testing techniques. In this paper, we check a priori global identifiability of some of these nonlinear HIV models taken from the recent literature, by using a differential algebra algorithm based on previous work of the author. The algorithm is implemented in a software tool, called DAISY (Differential Algebra for Identifiability of SYstems), which has been recently released (DAISY is freely available on the web site ). The software can be used to automatically check global identifiability of (linear and) nonlinear models described by polynomial or rational differential equations, thus providing a general and reliable tool to test global identifiability of several HIV models proposed in the literature. It can be used by researchers with a minimum of mathematical background.     

Review: To be or not to be an identifiable model. Is this a relevant question in animal science modelling?

What is a good (useful) mathematical model in animal science? For models constructed for prediction purposes, the question of model adequacy (usefulness) has been traditionally tackled by statistical analysis applied to observed experimental data relative to model-predicted variables. However, little attention has been paid to analytic tools that exploit the mathematical properties of the model equations. For example, in the context of model calibration, before attempting a numerical estimation of the model parameters, we might want to know if we have any chance of success in estimating a unique best value of the model parameters from available measurements. This question of uniqueness is referred to as structural identifiability; a mathematical property that is defined on the sole basis of the model structure within a hypothetical ideal experiment determined by a setting of model inputs (stimuli) and observable variables (measurements). Structural identifiability analysis applied to dynamic models described by ordinary differential equations (ODEs) is a common practice in control engineering and system identification. This analysis demands mathematical technicalities that are beyond the academic background of animal science, which might explain the lack of pervasiveness of identifiability analysis in animal science modelling. To fill this gap, in this paper we address the analysis of structural identifiability from a practitioner perspective by capitalizing on the use of dedicated software tools. Our objectives are (i) to provide a comprehensive explanation of the structural identifiability notion for the community of animal science modelling, (ii) to assess the relevance of identifiability analysis in animal science modelling and (iii) to motivate the community to use identifiability analysis in the modelling practice (when the identifiability question is relevant). We focus our study on ODE models. By using illustrative examples that include published mathematical models describing lactation in cattle, we show how structural identifiability analysis can contribute to advancing mathematical modelling in animal science towards the production of useful models and, moreover, highly informative experiments via optimal experiment design. Rather than attempting to impose a systematic identifiability analysis to the modelling community during model developments, we wish to open a window towards the discovery of a powerful tool for model construction and experiment design.     

The structural identifiability and parameter estimation of a multispecies model for the transmission of mastitis in dairy cows.

A structural identifiability analysis is performed on a mathematical model for the coupled transmission of two classes of pathogen. The pathogens, classified as major and minor, are aetiological agents of mastitis in dairy cows that interact directly and via the immunological reaction in their hosts. Parameter estimates are available from experimental data for all but four of the parameters in the model. Data from a longitudinal study of infection are used to estimate these unknown parameters. A novel approach and application of structural identifiability analysis is combined in this paper with the estimation of cross-protection parameters using epidemiological data.     

Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies

Mutation rate variation across loci is well known to cause difficulties, notably identifiability issues, in the reconstruction of evolutionary trees from molecular sequences. Here we introduce a new approach for estimating general rates-across-sites models. Our results imply, in particular, that large phylogenies are typically identifiable under rate variation. We also derive sequence-length requirements for high-probability reconstruction. Our main contribution is a novel algorithm that clusters sites according to their mutation rate. Following this site clustering step, standard reconstruction techniques can be used to recover the phylogeny. Our results rely on a basic insight: that, for large trees, certain site statistics experience concentration-of-measure phenomena.     

Global identifiability of latent class models with applications to diagnostic test accuracy studies: A Gröbner basis approach

Identifiability of statistical models is a fundamental regularity condition that is required for valid statistical inference. Investigation of model identifiability is mathematically challenging for complex models such as latent class models. Jones et al. used Goodman's technique to investigate the identifiability of latent class models with applications to diagnostic tests in the absence of a gold standard test. The tool they used was based on examining the singularity of the Jacobian or the Fisher information matrix, in order to obtain insights into local identifiability (ie, there exists a neighborhood of a parameter such that no other parameter in the neighborhood leads to the same probability distribution as the parameter). In this paper, we investigate a stronger condition: global identifiability (ie, no two parameters in the parameter space give rise to the same probability distribution), by introducing a powerful mathematical tool from computational algebra: the Gröbner basis. With several existing well-known examples, we argue that the Gröbner basis method is easy to implement and powerful to study global identifiability of latent class models, and is an attractive alternative to the information matrix analysis by Rothenberg and the Jacobian analysis by Goodman and Jones et al.     

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.     

Identifiability and retrievability of unique parameters describing intrinsic Andrews kinetics

A key factor contributing to the variability in the microbial kinetic parameters reported from batch assays is parameter identifiability, i.e., the ability of the mathematical routine used for parameter estimation to provide unique estimates of the individual parameter values. This work encompassed a three-part evaluation of the parameter identifiability of intrinsic kinetic parameters describing the Andrews growth model that are obtained from batch assays. First, a parameter identifiability analysis was conducted by visually inspecting the sensitivity equations for the Andrews growth model. Second, the practical retrievability of the parameters in the presence of experimental error was evaluated for the parameter estimation routine used. Third, the results of these analyses were tested using an example data set from the literature for a self-inhibitory substrate. The general trends from these analyses were consistent and indicated that it is very difficult, if not impossible, to simultaneously obtain a unique set of estimates of intrinsic kinetic parameters for the Andrews growth model using data from a single batch experiment.     

Multi-Target Analysis and Design of Mitochondrial Metabolism

Analyzing and optimizing biological models is often identified as a research priority in biomedical engineering. An important feature of a model should be the ability to find the best condition in which an organism has to be grown in order to reach specific optimal output values chosen by the researcher. In this work, we take into account a mitochondrial model analyzed with flux-balance analysis. The optimal design and assessment of these models is achieved through single- and/or multi-objective optimization techniques driven by epsilon-dominance and identifiability analysis. Our optimization algorithm searches for the values of the flux rates that optimize multiple cellular functions simultaneously. The optimization of the fluxes of the metabolic network includes not only input fluxes, but also internal fluxes. A faster convergence process with robust candidate solutions is permitted by a relaxed Pareto dominance, regulating the granularity of the approximation of the desired Pareto front. We find that the maximum ATP production is linked to a total consumption of NADH, and reaching the maximum amount of NADH leads to an increasing request of NADH from the external environment. Furthermore, the identifiability analysis characterizes the type and the stage of three monogenic diseases. Finally, we propose a new methodology to extend any constraint-based model using protein abundances.     

Construction of a large scale integrated map of macrophage pathogen recognition and effector systems

Background

Mathematical models provide abstract representations of the information gained from experimental observations on the structure and function of a particular biological system. Conferring a predictive character on a given mathematical formulation often relies on determining a number of non-measurable parameters that largely condition the model's response. These parameters can be identified by fitting the model to experimental data. However, this fit can only be accomplished when identifiability can be guaranteed.

Results

We propose a novel iterative identification procedure for detecting and dealing with the lack of identifiability. The procedure involves the following steps: 1) performing a structural identifiability analysis to detect identifiable parameters; 2) globally ranking the parameters to assist in the selection of the most relevant parameters; 3) calibrating the model using global optimization methods; 4) conducting a practical identifiability analysis consisting of two (a priori and a posteriori) phases aimed at evaluating the quality of given experimental designs and of the parameter estimates, respectively and 5) optimal experimental design so as to compute the scheme of experiments that maximizes the quality and quantity of information for fitting the model.

Conclusions

The presented procedure was used to iteratively identify a mathematical model that describes the NF-κB regulatory module involving several unknown parameters. We demonstrated the lack of identifiability of the model under typical experimental conditions and computed optimal dynamic experiments that largely improved identifiability properties.     

Identifiability analysis and improvement of a tree water flow and storage model

A recently published tree water flow and storage model (RCGro) for simulating water transport dynamics in trees and related stem diameter variations was improved in order to better describe a data set gathered under mild drought stress conditions. Model improvements were carried out based on the results of a mathematical identifiability analysis. This analysis provided important information with respect to the balance between model complexity and data availability. Using the identifiability analysis results, we were able to (1) highlight weaknesses of the model; (2) obtain information on how the model could be reduced in some places, to improve its identifiability properties, and extended in others, to enhance model performance; (3) identify which measurements are necessary to optimally calibrate the model. The resulting improved model was less complex (contained less unidentifiable parameters), had better dynamic properties and was able to better describe the stress data set.     

Model reduction and a priori kinetic parameter identifiability analysis using metabolome time series for metabolic reaction networks with linlog kinetics

In this work, we present a time-scale analysis based model reduction and parameter identifiability analysis method for metabolic reaction networks. The method uses the information obtained from short term chemostat perturbation experiments. We approximate the time constant of each metabolite pool by their turn-over time and classify the pools accordingly into two groups: fast and slow pools. We performed a priori model reduction, neglecting the dynamic term of the fast pools. By making use of the linlog approximative kinetics, we obtained a general explicit solution for the fast pools in terms of the slow pools by elaborating the degenerate algebraic system resulting from model reduction. The obtained relations yielded also analytical relations between a subset of kinetic parameters. These relations also allow to realize an analytical model reduction using lumped reaction kinetics. After solving these theoretical identifiability problems and performing model reduction, we carried out a Monte Carlo approach to study the practical identifiability problems. We illustrated the methodology on model reduction and theoretical/practical identifiability analysis on an example system representing the glycolysis in Saccharomyces cerevisiae cells.     

Exploration of the intercellular heterogeneity of topotecan uptake into human breast cancer cells through compartmental modelling

A mathematical multi-cell model for the in vitro kinetics of the anti-cancer agent topotecan (TPT) following administration into a culture medium containing a population of human breast cancer cells (MCF-7 cell line) is described. This non-linear compartmental model is an extension of an earlier single-cell type model and has been validated using experimental data obtained using two-photon laser scanning microscopy (TPLSM). A structural identifiability analysis is performed prior to parameter estimation to test whether the unknown parameters within the model are uniquely determined by the model outputs. The full model has 43 compartments, with 107 unknown parameters, and it was found that the structural identifiability result could not be established even when using the latest version of the symbolic computation software Mathematica. However, by assuming that a priori knowledge is available for certain parameters, it was possible to reduce the number of parameters to 81, and it was found that this (Stage Two) model was globally (uniquely) structurally identifiable. The identifiability analysis demonstrated how valuable symbolic computation is in this context, as the analysis is far too lengthy and difficult to be performed by hand.     

On the identifiability of metabolic network models

A major problem for the identification of metabolic network models is parameter identifiability, that is, the possibility to unambiguously infer the parameter values from the data. Identifiability problems may be due to the structure of the model, in particular implicit dependencies between the parameters, or to limitations in the quantity and quality of the available data. We address the detection and resolution of identifiability problems for a class of pseudo-linear models of metabolism, so-called linlog models. Linlog models have the advantage that parameter estimation reduces to linear or orthogonal regression, which facilitates the analysis of identifiability. We develop precise definitions of structural and practical identifiability, and clarify the fundamental relations between these concepts. In addition, we use singular value decomposition to detect identifiability problems and reduce the model to an identifiable approximation by a principal component analysis approach. The criterion is adapted to real data, which are frequently scarce, incomplete, and noisy. The test of the criterion on a model with simulated data shows that it is capable of correctly identifying the principal components of the data vector. The application to a state-of-the-art dataset on central carbon metabolism in Escherichia coli yields the surprising result that only $4$ out of $31$ reactions, and $37$ out of $100$ parameters, are identifiable. This underlines the practical importance of identifiability analysis and model reduction in the modeling of large-scale metabolic networks. Although our approach has been developed in the context of linlog models, it carries over to other pseudo-linear models, such as generalized mass-action (power-law) models. Moreover, it provides useful hints for the identifiability analysis of more general classes of nonlinear models of metabolism.     

Differential algebra methods for the study of the structural identifiability of rational function state-space models in the biosciences

In this paper methods from differential algebra are used to study the structural identifiability of biological and pharmacokinetics models expressed in state-space form and with a structure given by rational functions. The focus is on the examples presented and on the application of efficient, automatic methods to test for structural identifiability for various input-output experiments. Differential algebra methods are coupled with Gr?bner bases, Lie derivatives and the Taylor series expansion in order to obtain efficient algorithms. In particular, an upper bound on the number of derivatives needed for the Taylor series approach for a structural identifiability analysis of rational function models is given.     

Variable Selection for Clustering with Gaussian Mixture Models

Summary .  This article is concerned with variable selection for cluster analysis. The problem is regarded as a model selection problem in the model-based cluster analysis context. A model generalizing the model of Raftery and Dean (2006,  Journal of the American Statistical Association   101, 168–178) is proposed to specify the role of each variable. This model does not need any prior assumptions about the linear link between the selected and discarded variables. Models are compared with Bayesian information criterion. Variable role is obtained through an algorithm embedding two backward stepwise algorithms for variable selection for clustering and linear regression. The model identifiability is established and the consistency of the resulting criterion is proved under regularity conditions. Numerical experiments on simulated datasets and a genomic application highlight the interest of the procedure.