Structural identifiability analysis of some highly structured families of statespace models using differential algebra

IDENTIFIABILITY OF INFECTION MODEL PARAMETERS EARLY IN AN EPIDEMIC

It is known that the parameters in the deterministic and stochastic SEIR epidemic models are structurally identifiable. For example, from knowledge of the infected population time series I(t) during the entire epidemic, the parameters can be successfully estimated. In this article we observe that estimation will fail in practice if only infected case data during the early part of the epidemic (prepeak) is available. This fact can be explained using a well-known phenomenon called dynamical compensation. We use this concept to derive an unidentifiability manifold in the parameter space of SEIR that consists of parameters indistinguishable from I(t) early in the epidemic. Thus, identifiability depends on the extent of the system trajectory that is available for observation. Although the existence of the unidentifiability manifold obstructs the ability to exactly determine the parameters, we suggest that it may be useful for uncertainty quantification purposes. A variant of SEIR recently proposed for COVID-19 modeling is also analyzed, and an analogous unidentifiability surface is derived.

Structural Identifiability of Dynamic Systems Biology Models

A powerful way of gaining insight into biological systems is by creating a nonlinear differential equation model, which usually contains many unknown parameters. Such a model is called structurally identifiable if it is possible to determine the values of its parameters from measurements of the model outputs. Structural identifiability is a prerequisite for parameter estimation, and should be assessed before exploiting a model. However, this analysis is seldom performed due to the high computational cost involved in the necessary symbolic calculations, which quickly becomes prohibitive as the problem size increases. In this paper we show how to analyse the structural identifiability of a very general class of nonlinear models by extending methods originally developed for studying observability. We present results about models whose identifiability had not been previously determined, report unidentifiabilities that had not been found before, and show how to modify those unidentifiable models to make them identifiable. This method helps prevent problems caused by lack of identifiability analysis, which can compromise the success of tasks such as experiment design, parameter estimation, and model-based optimization. The procedure is called STRIKE-GOLDD (STRuctural Identifiability taKen as Extended-Generalized Observability with Lie Derivatives and Decomposition), and it is implemented in a MATLAB toolbox which is available as open source software. The broad applicability of this approach facilitates the analysis of the increasingly complex models used in systems biology and other areas.

Reconstructing mammalian sleep dynamics with data assimilation

Data assimilation is a valuable tool in the study of any complex system, where measurements are incomplete, uncertain, or both. It enables the user to take advantage of all available information including experimental measurements and short-term model forecasts of a system. Although data assimilation has been used to study other biological systems, the study of the sleep-wake regulatory network has yet to benefit from this toolset. We present a data assimilation framework based on the unscented Kalman filter (UKF) for combining sparse measurements together with a relatively high-dimensional nonlinear computational model to estimate the state of a model of the sleep-wake regulatory system. We demonstrate with simulation studies that a few noisy variables can be used to accurately reconstruct the remaining hidden variables. We introduce a metric for ranking relative partial observability of computational models, within the UKF framework, that allows us to choose the optimal variables for measurement and also provides a methodology for optimizing framework parameters such as UKF covariance inflation. In addition, we demonstrate a parameter estimation method that allows us to track non-stationary model parameters and accommodate slow dynamics not included in the UKF filter model. Finally, we show that we can even use observed discretized sleep-state, which is not one of the model variables, to reconstruct model state and estimate unknown parameters. Sleep is implicated in many neurological disorders from epilepsy to schizophrenia, but simultaneous observation of the many brain components that regulate this behavior is difficult. We anticipate that this data assimilation framework will enable better understanding of the detailed interactions governing sleep and wake behavior and provide for better, more targeted, therapies.

Mathematical models are developed to better understand interactions between components of a system that together govern the overall behavior. Mathematical models of sleep have helped to elucidate the neuronal cell groups that are involved in promoting sleep and wake behavior and the transitions between them. However, to be able to take full advantage of these models one must be able to estimate the value of all included variables accurately. Data assimilation refers to methods that allow the user to combine noisy measurements of just a few system variables with the mathematical model of that system to estimate all variables, including those originally inaccessible for measurement. Using these techniques we show that we can reconstruct the unmeasured variables and parameters of a mathematical model of the sleep-wake network. These reconstructed estimates can then be used to better understand the underlying neuronal behavior that results in sleep and wake activity. Because sleep is implicated in a wide array of neurological disorders from epilepsy to schizophrenia, we anticipate that this framework will enable better understanding of the link between sleep and the rest of the brain and provide for better, more targeted, therapies.

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.

Structural identifiability and indistinguishability of compartmental models

The deterministic identifiability of models is only normally considered if a problem becomes apparent in the parameter identification stage of data analysis. If no problem is perceived then the analysis will continue. However, although the problem does not become apparent, the implications of ambiguities in what is inferred from the data should be considered. This paper reviews some fundamentals with respect to model indistinguishability and parameter identifiability.

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.