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: 2026-10-14 11:22:02 UTC; root
Author: Guillem Rigaill [aut, cre], Toby Hocking [aut], Robert
        Maidstone [aut], Michel Koskas [ctb], Paul Fearnhead [aut]
Repository: https://cranhaven.r-universe.dev
Date/Publication: 2026-09-14 05:02:00 UTC
RemoteUrl: https://github.com/cranhaven/cranhaven.r-universe.dev
RemoteRef: package/fpop
RemoteSha: 2106d565633425416e5e74a8e23c6dc2bfcf3d4c
RemoteSubdir: fpop