Skip Navigation


Bioinformatics Advance Access originally published online on July 28, 2007
Bioinformatics 2007 23(19):2612-2618; doi:10.1093/bioinformatics/btm382
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow Supplementary data
Right arrow All Versions of this Article:
23/19/2612    most recent
btm382v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hengl, S.
Right arrow Articles by Maiwald, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Hengl, S.
Right arrow Articles by Maiwald, T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Data-based identifiability analysis of non-linear dynamical models

S. Hengl *, C. Kreutz , J. Timmer and T. Maiwald

Physics Institute, University of Freiburg, Hermann Herder Strasse 3, 79104 Freiburg i.Br., Germany

*To whom correspondence should be addressed.


   Abstract

Motivation: Mathematical modelling of biological systems is becoming a standard approach to investigate complex dynamic, non-linear interaction mechanisms in cellular processes. However, models may comprise non-identifiable parameters which cannot be unambiguously determined. Non-identifiability manifests itself in functionally related parameters, which are difficult to detect.

Results: We present the method of mean optimal transformations, a non-parametric bootstrap-based algorithm for identifiability testing, capable of identifying linear and non-linear relations of arbitrarily many parameters, regardless of model size or complexity. This is performed with use of optimal transformations, estimated using the alternating conditional expectation algorithm (ACE). An initial guess or prior knowledge concerning the underlying relation of the parameters is not required. Independent, and hence identifiable parameters are determined as well. The quality of data at disposal is included in our approach, i.e. the non-linear model is fitted to data and estimated parameter values are investigated with respect to functional relations. We exemplify our approach on a realistic dynamical model and demonstrate that the variability of estimated parameter values decreases from 81 to 1% after detection and fixation of structural non-identifiabilities.

Availability: Our algorithm is written in Matlab and R. It is available from the authors on request. An implementation of ACE, written in Matlab as well as in C, is available online at www.stefanhengl.de

Contact: hengl{at}fdm.uni-freiburg.de

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Limsoon Wong


Received on April 4, 2007; revised on July 10, 2007; accepted on July 10, 2007

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
T. Maiwald and J. Timmer
Dynamical modeling and multi-experiment fitting with PottersWheel
Bioinformatics, September 15, 2008; 24(18): 2037 - 2043.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. Schmidt, M. F. Madsen, S. Dano, and G. Cedersund
Complexity reduction of biochemical rate expressions
Bioinformatics, March 15, 2008; 24(6): 848 - 854.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.