Constrained dynamic programming and supervised penalty learning algorithms for peak detection in genomic data
From MaRDI portal
Publication:4969147
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
Cites work
- 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
- Algorithms for the optimal identification of segment neighborhoods
- Detecting multiple change-points in the mean of Gaussian process by model selection
- Estimating the number of change-points via Schwarz' criterion
- On optimal multiple changepoint algorithms for large data
- Optimal detection of changepoints with a linear computational cost
- Segmentation of the Poisson and negative binomial rate models: a penalized estimator
- The Reduced Monotonic Regression Method
Cited in
(5)
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)
