multiBinSeg

<p>A matrix with p columns and n lines, each column is one of the profile</p>

geno

Kmax

<p>Binary segmentation of p profiles using the L2 loss</p>

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.

Guillem Rigaill

fpop

Segmentation using Optimal Partitioning and Function Pruning

Toby Hocking

Robert Maidstone

Michel Koskas

Paul Fearnhead

multiBinSeg function

multiBinSeg — multiBinSeg

multiBinSeg: multiBinSeg

Description

Usage

Arguments

Value