{"id":"W3038255897","doi":"","title":"Constrained Dynamic Programming and Supervised Penalty Learning Algorithms for Peak Detection in Genomic Data","year":2020,"lang":"en","type":"preprint","venue":"Lancaster EPrints (Lancaster University)","topic":"Cancer-related molecular mechanisms research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Genome Canada","keywords":"Computer science; Dynamic programming; Heuristics; Algorithm; Benchmark (surveying); Scalability; Pattern recognition (psychology); Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00468459,0.001910952,0.00218143,0.001976402,0.0009060838,0.001916531,0.004598403,0.002778074,0.004050912],"category_scores_gemma":[0.0209258,0.001489219,0.001893019,0.002905859,0.001976623,0.002844223,0.002878957,0.006001707,0.00180559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001773918,"about_ca_system_score_gemma":0.002898911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005648086,"about_ca_topic_score_gemma":0.007490493,"domain_scores_codex":[0.996732,0.001287344,0.00017265,0.0009912126,0.0006159038,0.0002008707],"domain_scores_gemma":[0.9874949,0.008843298,0.000739178,0.001196394,0.001387347,0.0003389747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001915342,0.0002253501,0.001439669,0.0002015284,0.0001435496,0.00007900988,0.0001485537,0.7869669,0.002475252,0.02718258,0.005643693,0.1753024],"study_design_scores_gemma":[0.00001218104,0.00001335786,0.0001127317,0.000008009531,0.00000404324,0.00001232376,0.000007193055,0.9793763,0.0004984941,0.01935388,0.0005918474,0.000009565288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002371177,0.0001173479,0.9960991,0.0001646913,0.00002327809,0.00003659882,0.0001064542,0.0007679889,0.0003134315],"genre_scores_gemma":[0.06552988,0.0002020752,0.9287031,0.0003812122,0.0001145812,0.0004774384,0.001387229,0.0008672729,0.002337299],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005648086,"threshold_uncertainty_score":0.02477473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04187535927082319,"score_gpt":0.2826015777106855,"score_spread":0.2407262184398623,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}