Learn R Programming

seqCBS (version 1.2.1)

ScanCBS: Main CBS Algorithm for Change-Point Detection

Description

This is the main algorithm. It teratively scans for window of arbitrary size where the case and control read depths are different. It continues until a stopping criterion based on mBIC, maximum number of cut, and the statistic at the current segment.

Usage

ScanCBS(cases, controls, statistic = "binomial", grid.size = "auto", takeN = 5, 
  maxNCut = 100, minStat = 0, alpha=0.05, verbose = FALSE, timing = TRUE)

Arguments

cases

A numeric vector of the case/tumor reads

controls

A numeric vector of the control/normal reads

statistic

The statistic to be used. Can be 'binomial','rabinowitz' or 'normal'.

grid.size

The set of grid sizes for the iterative search. An automatic default can be computed.

takeN

The number of candidate change points to be added to a temporary set at each grid size

maxNCut

The maximum number of segmentation steps to perform

minStat

The minimum statistic value required to continue the segmentation. Default 0 as this criterion being ignored.

alpha

Significance level for testing whether each segment is a gain (relative CN > 1) or loss (relative CN < 1). The method internally corrects for multiple testing.

verbose

If TRUE, then will print much information on each segmentation. For diagnostics only.

timing

If TRUE, perform a timing of this algorithm, include in the output data file.

Value

tauHat

The change points called

statHat

A matrix containing the statistic and its segmentation for the model called, in the order of the segmentation. The columns are break points in genomic scale (1,2), read index scale (3,4), value of test statistic (5), the parent segment in genomic scale (6,7), and mBIC of the model (8).

relCN

The relative CN computed for each segment between change points

relGainLoss

Test result of whether each segment is a gain, loss, or normal

timingRes

A list containing the result of the timing of this algorithm

Details

This algorithm is an use of the Circular Binary Segmentation method. It continues to segment the reads and consider the resulting child regions for further segmentation. It keeps track of the most promising cut in each children, and only the child region with the most significant segmentation is further cut, yielding more children. This is repeated until stopping criteria are met. The three types of statistics are by the use of exact binomial likelihood ('binomial'), score statistic ('rabinowitz') or using normal approximation to the binomial ('normal').

References

D. Rabinowitz, IMS Lecture Notes - Monograph Series, Vol. 23, 1994

See Also

ScanIterateGrid, ScanBIC, relCNComp, getAutoGridSize