# ------------------------------------------------
# CITATION.cff file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# ------------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "fpop" in publications use:'
type: software
license: LGPL-2.0-or-later
title: 'fpop: Segmentation using Optimal Partitioning and Function Pruning'
version: 2019.08.26
identifiers:
- type: doi
  value: 10.32614/CRAN.package.fpop
abstract: 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 <https://doi.org/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.
authors:
- family-names: Rigaill
  given-names: Guillem
  email: guillem.rigaill@inra.fr
- family-names: Hocking
  given-names: Toby
- family-names: Maidstone
  given-names: Robert
- family-names: Fearnhead
  given-names: Paul
preferred-citation:
  type: article
  title: On optimal multiple changepoint algorithms for large data
  authors:
  - family-names: Maidstone
    given-names: Robert
  - family-names: Hocking
    given-names: Toby
  - family-names: Rigaill
    given-names: Guillem
    email: guillem.rigaill@inra.fr
  - family-names: Fearnhead
    given-names: Paul
  journal: Statistics and Computing
  year: '2017'
  volume: '27'
  url: https://link.springer.com/article/10.1007/s11222-016-9636-3
  publisher:
    name: Springer
repository: https://cranhaven.r-universe.dev
commit: 2106d565633425416e5e74a8e23c6dc2bfcf3d4c
date-released: '2026-09-14'
contact:
- family-names: Rigaill
  given-names: Guillem
  email: guillem.rigaill@inra.fr