H3K36me3.TDH.other.chunk3.cluster4

these data caused a bug in multiSampleSegHeuristic.

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.TDH.other.chunk3.cluster4 function

A data frame with 36914 observations on the following 4 variables.<dl class="dl-horizontal">
 <dt><code>sample.id</code></dt><dd>a factor with 8 levels</dd>
 <dt><code>chromStart</code></dt><dd>integer vector</dd>
 <dt><code>chromEnd</code></dt><dd>integer vector</dd>
 <dt><code>count</code></dt><dd>integer vector</dd>
 </dl>

Format

8 profiles of H3K36me3 data — H3K36me3.TDH.other.chunk3.cluster4

A data frame with 36914 observations on the following 4 variables.<dl class='dl-horizontal'>
 <dt><code>sample.id</code></dt><dd>a factor with 8 levels</dd>
 <dt><code>chromStart</code></dt><dd>integer vector</dd>
 <dt><code>chromEnd</code></dt><dd>integer vector</dd>
 <dt><code>count</code></dt><dd>integer vector</dd>
 </dl>

H3K36me3.TDH.other.chunk3.cluster4: 8 profiles of H3K36me3 data

Description

Usage

Arguments

Format