{"id":"W2725040470","doi":"10.1101/159632","title":"Efficient strategies for screening large-scale genetic interaction networks","year":2017,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Canadian Institute for Advanced Research; National Institutes of Health; National Science Foundation","keywords":"Computer science; Set (abstract data type); Genetic algorithm; Resource (disambiguation); Computational biology; Scale (ratio); Genetic screen; Throughput; Genome; Function (biology); High-throughput screening; Process (computing); Gene; Machine learning; Biology; Genetics; Mutant; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.001667413,0.001475304,0.001431705,0.001705218,0.0007693769,0.001240524,0.001705986,0.001042113,0.001974312],"category_scores_gemma":[0.005068684,0.0007707906,0.001116692,0.001359618,0.001044643,0.00143842,0.001981983,0.001582304,0.0006628904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001343399,"about_ca_system_score_gemma":0.001401564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001216353,"about_ca_topic_score_gemma":0.002614094,"domain_scores_codex":[0.9987738,0.0004550393,0.00005541851,0.0002815831,0.000339465,0.00009481247],"domain_scores_gemma":[0.9976648,0.001522846,0.0001769853,0.0003645729,0.0001691328,0.0001016644],"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.0004089758,0.0003009739,0.002834844,0.0005263763,0.0001824502,0.00029649,0.0001873339,0.6534715,0.08809079,0.07014287,0.004138626,0.1794188],"study_design_scores_gemma":[0.00004849267,0.00006039928,0.0002986011,0.00001002956,0.00003012906,0.00008703669,0.00003531179,0.9458979,0.01300941,0.03801577,0.002490838,0.00001600342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03245707,0.0003775797,0.9632099,0.000252285,0.00001752911,0.0001550128,0.0002822173,0.001594132,0.001654252],"genre_scores_gemma":[0.1807134,0.0004096595,0.8159661,0.0001345156,0.00001643311,0.0004790835,0.001101357,0.0002583005,0.0009210879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001974312,"threshold_uncertainty_score":0.009747088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01214509819060702,"score_gpt":0.2369713933795173,"score_spread":0.2248262951889103,"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."}}