ScanIterateGrid: Main Scan with Iterative Grid Search

Description Usage Arguments Details Value Author(s) See Also

View source: R/ScanIterateGrid.R

Description

This is a computational speed-up to prevent a quadratic order computation.

Usage

1
ScanIterateGrid(combX, combZ, combL, statistic, grid.size, nGridSize, timeIGSBreakDown, takeN, verbose, timing)

Arguments

combX

The number of reads at the unique read positions

combZ

The number of case reads at the unique read positions

combL

The set of the labels for the unique read positions

statistic

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

grid.size

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

nGridSize

The number of grid sizes

timeIGSBreakDown

Cumulative timing of IGS, in a broken down fashion

takeN

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

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.

Details

This algorithm is a computational speed-up tool. It computes the statistic on coarse grids, and refine to finer grids. Also, at each refinement, it computes all new smaller windows on the finer grid that would not have been captured by the coarse grid. Hence it has a New Scan step and a Refine Scan step, both implemented in C for speed.

Value

cptsRet

The current set of change points called after the IGS scan of the current region

timeIGSBreakDown

A break-down of the time used at the stages of the IGS

Author(s)

Jeremy J. Shen

See Also

ScanCBS, ScanStatNewComp, ScanStatRefineComp


SeqCNVCBS documentation built on May 2, 2019, 6:51 p.m.