2014
DOI: 10.1016/j.cmpb.2013.06.013
|View full text |Cite
|
Sign up to set email alerts
|

Structural identifiability analyses of candidate models for in vitro Pitavastatin hepatic uptake

Abstract: a b s t r a c tIn this paper a review of the application of four different techniques (a version of the similarity transformation approach for autonomous uncontrolled systems, a non-differential input/output observable normal form approach, the characteristic set differential algebra and a recent algebraic input/output relationship approach) to determine the structural identifiability of certain in vitro nonlinear pharmacokinetic models is provided. The Organic Anion Transporting Polypeptide (OATP) substrate, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(12 citation statements)
references
References 23 publications
0
12
0
Order By: Relevance
“…We applied the proposed methodology to a number of published models of varying size and complexity [19, 2732], some of which have been recently used to benchmark identifiability analysis methods [10, 19, 20]. The main features of the models are summarized in Table 2, and schematic diagrams are shown in Figs 2–4.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…We applied the proposed methodology to a number of published models of varying size and complexity [19, 2732], some of which have been recently used to benchmark identifiability analysis methods [10, 19, 20]. The main features of the models are summarized in Table 2, and schematic diagrams are shown in Figs 2–4.…”
Section: Resultsmentioning
confidence: 99%
“…Furthermore, the results obtained for the rational counterpart are not necessarily valid for the original non-rational model in the case of unidentifiability [18]. Recent studies [9, 10, 1921] show that, in general, the choice of a structural identifiability method involves trade-offs between generality of the application, computational cost, and level of detail of the results. In conclusion, there is currently a lack of structural identifiability methods of the sufficient generality and robustness to be applied to nonlinear models of general form and realistic size [21, 22].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…If equating the monomials of these functions produces only one solution for the unknown parameters, then the system is SGI. In terms of run time and memory utilisation, the univariate polynomial algorithm in Maple 2010 is the most efficient algorithm out of all the approaches described [54]. However, it can still be very memory-intensive, particularly if the model equations contain complicated nonlinear terms [54] (see Section 2).…”
Section: Algebraic Input/output Relationship Approachmentioning
confidence: 99%
“…The Rosenfeld-Gröbner algorithm in Maple 2010 can be very memory-intensive, particularly if the model equations contain complicated nonlinear terms. See [54] for examples of where this approach fails to yield results for nonlinear models, as there is not enough memory available for Maple 2010 to perform the required symbolic calculations.…”
Section: Differential Algebra Approach Using Characteristic Setsmentioning
confidence: 99%