states {RJaCGH} | R Documentation |
Methods for estimating the hidden state sequence of a RJaCGH model.
states(obj, k) ## S3 method for class 'RJaCGH': states(obj, k=NULL) ## S3 method for class 'RJaCGH.Chrom': states(obj, k=NULL) ## S3 method for class 'RJaCGH.genome': states(obj, k=NULL) ## S3 method for class 'RJaCGH.array': states(obj, k=NULL)
obj |
any of RJaCGH, RJaCGH.Chrom, RJaCGH.genome, RJaCGH.array objects |
k |
Model to summarize (i.e., number of hidden states). If NULL, the most visited is taken. |
The posterior probability of the hidden state sequence is computed via viterbi.
The state with more observatios is called 'Normal'. Those with bigger means than it are called 'Gain', 'Gain1'... and those with lesser means are called 'Loss', 'Loss1',...
Depending on the hierarchy of the object, it can return lists with
sublists, as in RJaCGH
.
states |
Factor with the hidden state sequence |
prob.states |
Matrix with the probabilities associated to every states for every observation. |
Oscar M. Rueda and Ramon Diaz Uriarte
Rueda OM, Diaz-Uriarte R. Flexible and Accurate Detection of Genomic Copy-Number Changes from aCGH. PLoS Comput Biol. 2007;3(6):e122
RJaCGH
,
summary.RJaCGH
, model.averaging
,
plot.RJaCGH
, trace.plot
,
gelman.brooks.plot
, collapseChain
## Not run: y <- c(rnorm(100, 0, 1), rnorm(10, -3, 1), rnorm(20, 3, 1), rnorm(100, 0, 1)) Pos <- sample(x=1:500, size=230, replace=TRUE) Pos <- cumsum(Pos) Chrom <- rep(1:23, rep(10, 23)) jp <- list(sigma.tau.mu=rep(0.05, 4), sigma.tau.sigma.2=rep(0.03, 4), sigma.tau.beta=rep(0.07, 4), tau.split.mu=0.1, tau.split.beta=0.1) fit.genome <- RJaCGH(y=y, Pos=Pos, Chrom=Chrom, model="genome", burnin=100, TOT=1000, jump.parameters=jp, k.max = 4) states(fit.genome) ## End(Not run)