H3K36me3.AM.immune.19

<p>These data are used to test the PeakSegDP algorithm,
  to make sure it gives sensible results, even when there are few data.</p>

datasets

A quadratic time dynamic programming algorithm
can be used to compute an approximate solution to the problem of
finding the most likely changepoints
with respect to the Poisson likelihood, subject
to a constraint on the number of segments, and the changes which must
alternate: up, down, up, down, etc. For more info read
<http://proceedings.mlr.press/v37/hocking15.html>
"PeakSeg: constrained optimal segmentation and supervised penalty learning
for peak detection in count data" by TD Hocking et al,
proceedings of ICML2015.

Toby Hocking

PeakSegDP

Dynamic Programming Algorithm for Peak Detection in ChIP-Seq
Data

H3K36me3.AM.immune.19 function

<p>Named list of 21 data.frames, each with columns chromStart, chromEnd, count.</p>

H3K36me3.AM.immune.19: Several ChIP-seq profiles, some of which have few data points

Description

Usage

Arguments

Format