PeakSegDP: Dynamic Programming Algorithm for Peak Detection in ChIP-Seq Data

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 <> "PeakSeg: constrained optimal segmentation and supervised penalty learning for peak detection in count data" by TD Hocking et al, proceedings of ICML2015.

Getting started

Package details

AuthorToby Dylan Hocking, Guillem Rigaill
MaintainerToby Dylan Hocking <>
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the PeakSegDP package in your browser

Any scripts or data that you put into this service are public.

PeakSegDP documentation built on May 1, 2019, 7:55 p.m.