资源分类
》 资源 》论文》PeakSeg: constrained optimal segmentation and supervised penalty learning for peak detection in count data

PeakSeg: constrained optimal segmentation and supervised penalty learning for peak detection in count data

2020-03-04 | |  55 |   41 |   0

Abstract

Peak detection is a central problem in genomic data analysis, and current algorithms for this task are unsupervised and mostly effective for a single data type and pattern (e.g. H3K4me3 data with a sharp peak pattern). We propose PeakSeg, a new constrained maximum likelihood segmentation model for peak detection with an efficient inference algorithm: constrained dynamic programming. We investigate unsupervised and supervised learning of penalties for the critical model selection problem. We show that the supervised method has state-of-the-art peak detection across all data sets in a benchmark that includes both sharp H3K4me3 and broad H3K36me3 patterns.

上一篇：Learning Parametric-Output HMMs with Two Aliased States

下一篇：The Fundamental Incompatibility of Scalable Hamiltonian Monte Carlo and Naive Data Subsampling

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...