Autor:
Współtwórca:
Korbicz, Józef (1951- ) - red. ; Uciński, Dariusz - red.
Tytuł:
Planning identification experiments for cell signaling pathways: an NF[kappa]B case study
Tytuł publikacji grupowej:
Temat i słowa kluczowe:
cell signaling pathways ; experiment design ; parameter estimation
Abstract:
Mathematical modeling of cell signaling pathways has become a very important and challenging problem in recent years. The importance comes from possible applications of obtained models. It may help us to understand phenomena appearing in single cells and cell populations on a molecular level. Furthermore, it may help us with the discovery of new drug therapies. Mathematical models of cell signaling pathways take different forms. The most popular way of mathematical modeling is to use a set of nonlinear ordinary differential equations (ODEs). It is very difficult to obtain a proper model. ; There are many hypotheses about the structure of the model (sets of variables and phenomena) that should be verified. The next step, fitting the parameters of the model, is also very complicated because of the nature of measurements. The blotting technique usually gives only semi-quantitative observations, which are very noisy and collected only at a limited number of time moments. The accuracy of parameter estimation may be significantly improved by a proper experiment design. ; Recently, we have proposed a gradient-based algorithm for the optimization of a sampling schedule. In this paper we use the algorithm in order to optimize a sampling schedule for the identification of the mathematical model of the NF?B regulatory module, known from the literature. We propose a two-stage optimization approach: a gradient-based procedure to find all stationary points and then pair-wise replacement for finding optimal numbers of replicates of measurements. Convergence properties of the presented algorithm are examined.
Wydawca:
Zielona Góra: Uniwersytet Zielonogórski
Data wydania:
Typ zasobu:
DOI:
Strony:
Źródło:
AMCS, Volume 20, Number 4 (2010) ; kliknij tutaj, żeby przejść