Constrained dynamic programming and supervised penalty learning algorithms for peak detection in genomic data

Keyphrases

• Genomic Data 100%
• Peak Detection 100%
• Learning Algorithm 100%
• Constrained Dynamic Programming 100%
• Change Point Detection 66%
• Dynamic Programming Algorithm 66%
• DNA Sequencing 33%
• Sequence Reads 33%
• Penalty Parameter 33%
• Detection Model 33%
• Log-linear 33%
• Detection Problem 33%
• Supervised Learning 33%
• Chromatin Immunoprecipitation (ChIP) 33%
• H3K36me3 33%
• H3K4me3 33%
• Existing Algorithms 33%
• Background Noise 33%
• Supervised Methods 33%
• Unsupervised Method 33%
• Mean Parameter 33%
• High Count Rate 33%
• Adjacent Segment 33%
• Problem with Constraints 33%
• Number of Segments 33%
• Linear Timing 33%
• Penalty Function 33%
• Low Counts 33%
• Single Pattern 33%

Computer Science

• Dynamic Programming 100%
• Dynamic Programming Algorithm 100%
• Learning Algorithm 100%
• Data Type 50%
• Supervised Learning 50%
• Supervised Method 50%
• Unsupervised Baseline Method 50%
• Background Noise 50%
• Penalty Function 50%