Description Usage Arguments Details Value Examples
Estimation of single Michaelis-Menten constant using the Gaussian process method The function estimates single Michaelis-Menten constant using the likelihood function with the Gaussian process method.
1 2 3 |
method |
method selection: T=TQ model, F=SQ model(default = T) |
RAM |
Robust Adaptive MCMC options (default = F) |
time |
total time of data |
dat |
observed dataset (trajectory column) |
enz |
enzyme concentrate |
subs |
substrate concentrate |
MM |
initial value of MM constant |
catal |
true value of catalytic constant |
nrepeat |
total number of iteration (default=10000) |
jump |
length of distance (default = 1) |
burning |
length of burning period (default=0) |
MM_m_v |
MM prior gamma mean, variance(default=c(1,10000)) |
sig |
standard deviation of univariate Normal proposal distribution |
va |
variance of dataset |
The function GP.MM generates a set of MCMC simulation samples from the conditional posterior distribution of Michaelis-Menten constant of enzyme kinetics model. As the MM constant is only parameter to be estimated in the function the user should assign catalytic constant as well as initial enzyme concentration and substrate concentration. The prior information for the parameter can be given. The GP.MM function can select Robust Adaptive Metropolis (RAM) algorithm as well as Metropolis-Hastings algorithm with random walk chain for MCMC procedure. When “RAM” is assigned T then the function use RAM method and the “sig” is used as initial standard deviation of normal proposal distribution. When “RAM” is F, the function use Metropolis-Hastings algorithm with random walk chain and the “sig” can be set to controlled proper mixing and acceptance ratio of the parameter from the conditional posterior distribution. The “va” is the variance of the Gaussian process. The posterior samples are only stored with fixed interval according to set "jump" to reduce serial correlation. The initial iterations are removed for convergence. The “burning” is set the length of initial iterations. The diffusion approximation method is used for construction of the likelihood.
A vector of posterior samples of catalytic constant
1 2 3 4 5 6 7 8 9 10 11 12 | ## Not run:
data('Chymo_low')
time1=max(Chymo_low[,1])*1.01
sm_GPMH=GP.MM(method=TRUE,time=time1,dat=Chymo_low[,2],enz=4.4e+7,subs=4.4e+7
,MM=4.4e+8,catal=0.05,nrepeat=10000,jump=1,burning=0
,MM_m_v=c(1,1e+10),sig=8e+7,va=var(Chymo_low[,2]))
# use RAM algorithm #
sm_GPRAM=GP.MM(method=TRUE,RAM=TRUE,time=time1,dat=Chymo_low[,2],enz=4.4e+7,subs=4.4e+7
,MM=4.4e+8,catal=0.05,nrepeat=10000,jump=1,burning=0
,MM_m_v=c(1,1e+10),sig=500,va=var(Chymo_low[,2]))
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.