Package: fpop
Type: Package
Title: Segmentation using Optimal Partitioning and Function Pruning
Version: 2019.08.26
Authors@R: c(person("Guillem", "Rigaill", email = "guillem.rigaill@inra.fr",
                  role = c("aut", "cre")),
	     person("Toby", "Hocking",
                  role = c("aut")),
	     person("Robert", "Maidstone",
                  role = c("aut")),
	     person("Michel", "Koskas",
                  role = c("ctb")),
	     person("Paul", "Fearnhead",
                  role = c("aut")))
Maintainer: Guillem Rigaill <guillem.rigaill@inra.fr>
Description: A dynamic programming algorithm for the fast segmentation of univariate signals into piecewise constant profiles.
  The 'fpop'  package is a wrapper to a C++ implementation of the fpop (Functional Pruning Optimal Partioning) algorithm described in Maidstone et al. 2017
  <doi:10.1007/s11222-016-9636-3>. The problem of detecting changepoints in an univariate sequence is formulated 
  in terms of minimising the mean squared error over segmentations. The fpop algorithm exactly minimizes the mean squared error 
  for a penalty linear in the number of changepoints.
License: LGPL (>= 2.1)
NeedsCompilation: yes
Packaged: 2019-08-26 05:34:19 UTC; grigaill
Author: Guillem Rigaill [aut, cre],
  Toby Hocking [aut],
  Robert Maidstone [aut],
  Michel Koskas [ctb],
  Paul Fearnhead [aut]
Repository: CRAN
Date/Publication: 2019-08-27 07:00:03 UTC
Built: R 4.6.0; x86_64-apple-darwin20; 2026-04-26 18:27:28 UTC; unix
Archs: fpop.so.dSYM
