Constrained dynamic programming and supervised penalty learning algorithms for peak detection in genomic data
zbMATH Open1502.92008MaRDI QIDQ4969147FDOQ4969147
Authors: Toby Hocking, Guillem Rigaill, Paul Fearnhead, Guillaume Bourque 
Publication date: 5 October 2020
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-843.html
Recommendations
- Multiple testing of local maxima for detection of peaks in ChIP-Seq data
- On optimal multiple changepoint algorithms for large data
- On-line changepoint detection and parameter estimation with application to genomic data
- Optimal detection of changepoints with a linear computational cost
- Fast estimation of posterior probabilities in change-point analysis through a constrained hidden Markov model
Learning and adaptive systems in artificial intelligence (68T05) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Dynamic programming in optimal control and differential games (49L20)
Cites Work
- On optimal multiple changepoint algorithms for large data
- Detecting multiple change-points in the mean of Gaussian process by model selection
- Estimating the number of change-points via Schwarz' criterion
- Algorithms for the optimal identification of segment neighborhoods
- Optimal detection of changepoints with a linear computational cost
- Segmentation of the Poisson and negative binomial rate models: a penalized estimator
- A Modified Bayes Information Criterion with Applications to the Analysis of Comparative Genomic Hybridization Data
- A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
- The Reduced Monotonic Regression Method
Cited In (5)
Uses Software
This page was built for publication: Constrained dynamic programming and supervised penalty learning algorithms for peak detection in genomic data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969147)
