{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000315356,0.0003898111,0.0004255303,0.0003037958,0.0001123023,0.0001196819,0.000811829,0.0005080802,0.00003109225],"category_scores_gemma":[0.00006615529,0.0004832896,0.0001208665,0.000194692,0.0001149113,0.00001829947,0.003773105,0.000856395,0.00001529943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001456524,"about_ca_system_score_gemma":0.0002266126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008243612,"about_ca_topic_score_gemma":0.0006481763,"domain_scores_codex":[0.9972598,0.0002040453,0.0002893799,0.001525812,0.0001884842,0.0005325053],"domain_scores_gemma":[0.9986235,0.00002633734,0.000170342,0.000872214,0.000112558,0.0001950373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002898061,0.000203592,0.00359588,0.001736909,0.0009308795,0.0005266265,0.0008338735,0.0001731549,0.7172856,0.00004490093,0.00004594656,0.2717246],"study_design_scores_gemma":[0.02532624,0.002627059,0.06720049,0.001292697,0.0008258619,0.0004988447,0.005212056,0.5526702,0.06275068,0.0003182561,0.2761155,0.005162126],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6278489,0.0003890476,0.3675049,0.0003205715,0.0003704719,0.002419634,0.0004049998,0.00006389035,0.0006776229],"genre_scores_gemma":[0.9890372,0.0002649516,0.007108259,0.00007442334,0.0001993384,0.00002148488,0.001931642,0.00009233839,0.001270347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6545349,"threshold_uncertainty_score":0.9997619,"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."}}