Description Usage Arguments Details Value Author(s) See Also

View source: R/ScanIterateGrid.R

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

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

`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', or 'normal' |

`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 |

`timing` |
If |

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. 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').

`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 |

Jeremy J. Shen

`ScanCBS`

, `ScanStatNewComp`

, `ScanStatRefineComp`

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.