Skip Navigation


Bioinformatics Advance Access originally published online on February 10, 2008
Bioinformatics 2008 24(6):848-854; doi:10.1093/bioinformatics/btn035
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
24/6/848    most recent
btn035v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Schmidt, H.
Right arrow Articles by Cedersund, G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Schmidt, H.
Right arrow Articles by Cedersund, G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Complexity reduction of biochemical rate expressions

Henning Schmidt 1,*, Mads F. Madsen 2, Sune Danø 2,{dagger} and Gunnar Cedersund 3

1Systems Biology and Bioinformatics Group, University of Rostock, Rostock, Germany, 2Department of Biomedical Sciences, University of Copenhagen, Copenhagen, Denmark and 3Department of Clinical and Experimental Medicine, Linköping University, Linköping, Sweden

*To whom correspondence should be addressed.


   Abstract

Motivation: The current trend in dynamical modelling of biochemical systems is to construct more and more mechanistically detailed and thus complex models. The complexity is reflected in the number of dynamic state variables and parameters, as well as in the complexity of the kinetic rate expressions. However, a greater level of complexity, or level of detail, does not necessarily imply better models, or a better understanding of the underlying processes. Data often does not contain enough information to discriminate between different model hypotheses, and such overparameterization makes it hard to establish the validity of the various parts of the model. Consequently, there is an increasing demand for model reduction methods.

Results: We present a new reduction method that reduces complex rational rate expressions, such as those often used to describe enzymatic reactions. The method is a novel term-based identifiability analysis, which is easy to use and allows for user-specified reductions of individual rate expressions in complete models. The method is one of the first methods to meet the classical engineering objective of improved parameter identifiability without losing the systems biology demand of preserved biochemical interpretation.

Availability: The method has been implemented in the Systems Biology Toolbox 2 for MATLAB, which is freely available from http://www.sbtoolbox2.org. The Supplementary Material contains scripts that show how to use it by applying the method to the example models, discussed in this article.

Contact: henning.schmidt{at}uni-rostock.de

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Jonathan Wren

{dagger}Present address: Topsoe Fuel Cell, Nymøllevej 66, DK-2800 Lyngby, Denmark.


Received on September 28, 2007; revised on December 17, 2007; accepted on January 22, 2008

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




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.