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
Package details 


Author  Toby Dylan Hocking, Guillem Rigaill 
Maintainer  Toby Dylan Hocking <[email protected]> 
License  GPL3 
Version  2017.08.15 
Package repository  View on GitHub 
Installation 
Install the latest version of this package by entering the following in R:

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.