{"id":"W4410905140","doi":"10.1101/2025.05.29.656836","title":"Making deep mutational scanning accessible: a cost-efficient approach to construct barcoded libraries for genes of any length","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; PROTEO","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Fonds de Recherche du Québec - Santé; Genome Canada","keywords":"Construct (python library); Computer science; Computational biology; Gene; Biology; Artificial intelligence; Genetics; Programming language","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.00127721,0.001049286,0.000829813,0.00113516,0.0003873136,0.001450655,0.00138685,0.0007842641,0.002697298],"category_scores_gemma":[0.001482461,0.0007682571,0.0007927555,0.0008718308,0.000774624,0.0007714347,0.002285038,0.002479124,0.002648306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000517977,"about_ca_system_score_gemma":0.000636942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004984717,"about_ca_topic_score_gemma":0.001051629,"domain_scores_codex":[0.9989484,0.0001567078,0.00007680538,0.0001962499,0.0004790385,0.0001427683],"domain_scores_gemma":[0.9990006,0.0002532786,0.0001900467,0.0002966564,0.0001401871,0.0001191755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005610941,0.00005292494,0.0001304363,0.00008763668,0.00001424811,0.00005736823,0.00003273042,0.000742977,0.9851032,0.00108797,0.0003244273,0.01230993],"study_design_scores_gemma":[0.00001683511,0.00009283528,0.0002802402,0.000009415843,0.00001914387,0.0001391845,0.00001523647,0.003766224,0.9887376,0.0005241036,0.006376287,0.00002291646],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1639643,0.0006648583,0.8255289,0.0005009758,0.0001407736,0.0004944578,0.001645716,0.004554679,0.002505395],"genre_scores_gemma":[0.3494083,0.001305156,0.6360409,0.0003179549,0.00005860074,0.0006074551,0.004637027,0.001440497,0.006184189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002697298,"threshold_uncertainty_score":0.009023309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02883854564128758,"score_gpt":0.2651608486627917,"score_spread":0.2363223030215041,"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."}}