English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we consider the Integrated Completed Likelihood (ICL) as auseful criterion for estimating the number of changes in the underlyingdistribution of data in problems where detecting the precise location of thesechanges is the main goal. The exact computation of the ICL requires O(Kn2)operations (with K the number of segments and n the number of data-points)which is prohibitive in many practical situations with large sequences of data.We describe a framework to estimate the ICL with O(Kn) complexity. Our approachis general in the sense that it can accommodate any given model distribution.We checked the run-time and validity of our approach on simulated data anddemonstrate its good performance when analyzing real Next-Generation Sequencing(NGS) data using a negative binomial model.

Fast estimation of the ICL criterion for change-point detection problems with applications to Next-Generation Sequencing data