An algorithm to segment count data using a binomial negative model

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

• Rigaill, G (INRA-CNRS-Universit d'Evry Val d'Essonne, URGV)
• Thursday 16 January 2014, 10:00-10:30
• Seminar Room 1, Newton Institute.

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.

This talk is included in these lists:

• All CMS events
• Cambridge Infectious Diseases
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.