文章基本信息

标题：A Priori Parameter Identifiability in Complex Reaction Networks ⁎
本地全文：下载
作者：Arun Varghese ; Sridharakumar Narasimhan ; Nirav Bhatt 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2018
卷号：51
期号：15
页码：760-765
DOI：10.1016/j.ifacol.2018.09.162
语种：English
出版社：Elsevier
摘要：AbstractA priori parameter identifiability is an important element in building reliable models for complex reaction networks in systems biology and chemical engineering. Differential algebra has been widely used to study a priori structural identifiability of nonlinear systems, and also implemented in several software tools, for example, DAISY (Differential Algebra for Identifiability of SYstems) (Bellu et al., Computer methods and programs in biomedicine, 88(1), 2017). This technique usually fails for complex reaction networks which involve several reactions and species. In this paper, we use the concept of extent of reaction to simplify the procedure for testing identifiability. A linear transformation is used to convert the system from the concentration domain to the extent domain so that the input output map is readily generated without use of Ritt’s pseudo–division algorithm. Then, further identifiability can be studied. The proposed approach is illustrated using a complex reaction network.
关键词：KeywordsParameter IdentifiabilityRitts Pseudo–Division AlgorithmExtent DomainComplex Reaction NetworksSystems Biology