Literature DB >> 20232992

Parameter identification, experimental design and model falsification for biological network models using semidefinite programming.

J Hasenauer1, S Waldherr, K Wagner, F Allgöwer.   

Abstract

One of the most challenging tasks in systems biology is parameter identification from experimental data. In particular, if the available data are noisy, the resulting parameter uncertainty can be huge and should be quantified. In this work, a set-based approach for parameter identification in discrete time models of biochemical reaction networks from time series data is developed. The basic idea is to determine an outer approximation to the set of parameters for which trajectories are consistent with the available data. In order to approximate the set of consistent parameters (SCP) a feasibility problem is derived. This feasibility problem is used to verify that complete parameter sets cannot contain consistent parameters. This method is very appealing because instead of checking a finite number of distinct points, complete sets are analysed. With this approach, model falsification simply corresponds to showing that the SCP is empty. Besides parameter identification, a novel set-based method for experimental design is presented. This method yields reliable predictions on the information content of future measurements also for the case of very limited a priori knowledge and uncertain inputs. The properties of the method are presented using a discrete time model of the MAP kinase cascade.

Mesh:

Year:  2010        PMID: 20232992     DOI: 10.1049/iet-syb.2009.0030

Source DB:  PubMed          Journal:  IET Syst Biol        ISSN: 1751-8849            Impact factor:   1.615


  14 in total

1.  Workflow for generating competing hypothesis from models with parameter uncertainty.

Authors:  David Gomez-Cabrero; Albert Compte; Jesper Tegner
Journal:  Interface Focus       Date:  2011-03-30       Impact factor: 3.906

2.  Quantifying biochemical reaction rates from static population variability within incompletely observed complex networks.

Authors:  Timon Wittenstein; Nava Leibovich; Andreas Hilfinger
Journal:  PLoS Comput Biol       Date:  2022-06-22       Impact factor: 4.779

3.  Retrieving relevant time-course experiments: a study on Arabidopsis microarrays.

Authors:  Duygu Dede Şener; Hasan Oğul
Journal:  IET Syst Biol       Date:  2016-06       Impact factor: 1.615

4.  An integrated strategy for prediction uncertainty analysis.

Authors:  J Vanlier; C A Tiemann; P A J Hilbers; N A W van Riel
Journal:  Bioinformatics       Date:  2012-02-21       Impact factor: 6.937

5.  A Bayesian approach to targeted experiment design.

Authors:  J Vanlier; C A Tiemann; P A J Hilbers; N A W van Riel
Journal:  Bioinformatics       Date:  2012-02-24       Impact factor: 6.937

6.  Set membership experimental design for biological systems.

Authors:  Skylar W Marvel; Cranos M Williams
Journal:  BMC Syst Biol       Date:  2012-03-21

7.  Efficient Optimization of Stimuli for Model-Based Design of Experiments to Resolve Dynamical Uncertainty.

Authors:  Thembi Mdluli; Gregery T Buzzard; Ann E Rundell
Journal:  PLoS Comput Biol       Date:  2015-09-17       Impact factor: 4.475

8.  Rational selection of experimental readout and intervention sites for reducing uncertainties in computational model predictions.

Authors:  Robert J Flassig; Iryna Migal; Esther van der Zalm; Liisa Rihko-Struckmann; Kai Sundmacher
Journal:  BMC Bioinformatics       Date:  2015-01-16       Impact factor: 3.169

9.  Parameter trajectory analysis to identify treatment effects of pharmacological interventions.

Authors:  Christian A Tiemann; Joep Vanlier; Maaike H Oosterveer; Albert K Groen; Peter A J Hilbers; Natal A W van Riel
Journal:  PLoS Comput Biol       Date:  2013-08-01       Impact factor: 4.475

10.  Optimal experiment design for model selection in biochemical networks.

Authors:  Joep Vanlier; Christian A Tiemann; Peter A J Hilbers; Natal A W van Riel
Journal:  BMC Syst Biol       Date:  2014-02-20
View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.