University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > An algorithm to segment count data using a binomial negative model

An algorithm to segment count data using a binomial negative model

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Inference for Change-Point and Related Processes

We consider the problem of segmenting a count data profile. We developed an algorithm to recover the best (w.r.t the likelihood) segmentations in 1 to K_{max} segments. We prove that the optimal segmentation can be recovered using a compression scheme which reduces the time complexity. The compression is particularly efficient when the signal has large plateaus. We illustrate our algorithm on next generation sequencing data.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity