{"id":"W2993248623","doi":"10.1101/863035","title":"ExpansionHunter Denovo: A computational method for locating known and novel repeat expansions in short-read sequencing data","year":2019,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canada Research Chairs; University of New Brunswick; BC Children's Hospital; University of Toronto; SickKids Foundation; Hospital for Sick Children; University of British Columbia","funders":"","keywords":"Computer science; Tandem repeat; Computational biology; Genome; Genetics; Biology; Gene","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004801178,0.001597046,0.002110076,0.003566499,0.001400464,0.002497367,0.003233774,0.001933516,0.01050545],"category_scores_gemma":[0.0156326,0.001485661,0.002368355,0.002238168,0.001232486,0.001631159,0.002657304,0.003064267,0.002948304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000960147,"about_ca_system_score_gemma":0.002300092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004705812,"about_ca_topic_score_gemma":0.01685524,"domain_scores_codex":[0.9981547,0.0005279437,0.0001318863,0.0005991983,0.0004599636,0.0001262664],"domain_scores_gemma":[0.9958863,0.003054798,0.0002183341,0.0004621583,0.0002483544,0.0001300936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003604025,0.0005226194,0.01559079,0.002586805,0.002649106,0.001046825,0.001092179,0.1238158,0.05438834,0.03220598,0.1443657,0.6181319],"study_design_scores_gemma":[0.0006743754,0.0001354237,0.002672142,0.000155946,0.0001949747,0.0003600873,0.000161086,0.898527,0.01661165,0.03785266,0.04246991,0.0001846612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01679087,0.0009720121,0.8816688,0.000370052,0.0003340912,0.0003071131,0.006778897,0.0909688,0.001809262],"genre_scores_gemma":[0.04951547,0.000239995,0.9276354,0.0004629621,0.0001264382,0.0006762765,0.00957961,0.01005353,0.001710338],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01050545,"threshold_uncertainty_score":0.03514421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04433690203876772,"score_gpt":0.2892075723009666,"score_spread":0.2448706702621988,"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."}}