{"id":"W2151743318","doi":"10.1093/bioinformatics/btn173","title":"Optimal pooling for genome re-sequencing with ultra-high-throughput short-read technologies","year":2008,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; BC Cancer Agency","funders":"","keywords":"Pooling; Multiplex; DNA sequencing; Computer science; Bacterial artificial chromosome; Genome; Deep sequencing; Reference genome; Computational biology; Throughput; Algorithm; Biology; Genetics; Artificial intelligence; Gene; Telecommunications","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.006237259,0.001356256,0.001892023,0.001301282,0.0006949728,0.001349378,0.002515756,0.001040175,0.002732957],"category_scores_gemma":[0.01105975,0.0009648454,0.001333143,0.002027793,0.0011389,0.002832426,0.001710565,0.001367033,0.001070885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001581667,"about_ca_system_score_gemma":0.001299934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113129,"about_ca_topic_score_gemma":0.001790429,"domain_scores_codex":[0.9958745,0.002035393,0.0002151706,0.0007571304,0.0009308836,0.000187029],"domain_scores_gemma":[0.9914349,0.004865723,0.0006773463,0.002193631,0.0006439736,0.0001844541],"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.001077074,0.0004541638,0.002230884,0.000532208,0.0001949685,0.0002585087,0.0002629954,0.3402279,0.1092556,0.03190239,0.002647197,0.510956],"study_design_scores_gemma":[0.00008495102,0.0003016207,0.0009706228,0.00002625691,0.00006475022,0.000131008,0.00007277841,0.8729265,0.0748127,0.04629155,0.004276923,0.00004031775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01208224,0.0002011614,0.9863891,0.00007175002,0.00001831681,0.00008837338,0.00004471295,0.0007109549,0.0003933439],"genre_scores_gemma":[0.07267782,0.0001654051,0.9254004,0.00008625695,0.00002185185,0.0003350141,0.0003487235,0.0002014584,0.0007630269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006237259,"threshold_uncertainty_score":0.03298616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03724194633515261,"score_gpt":0.2452687117273708,"score_spread":0.2080267653922182,"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."}}