Description Usage Arguments Author(s) Examples

A constrained dynamic programming algorithm (cDPA) can be used to compute the best segmentation 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, ...

1 |

`count` |
Integer vector of count data to segment. |

`weight` |
Data weights (normally this is the number of base pairs). |

`maxSegments` |
Maximum number of segments to consider. |

Toby Dylan Hocking, Guillem Rigaill

1 2 3 |

```
```

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.