{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001542522,0.0001945056,0.0002202965,0.0001189281,0.0003900229,0.0001281943,0.0009159894,0.0001076984,0.000002682332],"category_scores_gemma":[0.00004594865,0.0001407215,0.00004812184,0.0002824495,0.0001113402,0.001409562,0.000236081,0.0001411575,0.00001859398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008012754,"about_ca_system_score_gemma":0.0001397117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001730067,"about_ca_topic_score_gemma":0.000002222865,"domain_scores_codex":[0.998718,0.000005968133,0.0003676632,0.0002175738,0.0002895823,0.0004012503],"domain_scores_gemma":[0.9989058,0.00007339064,0.0001314589,0.0007196427,0.0001110387,0.00005862155],"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.0003483387,0.0005641309,0.001182277,0.001772503,0.0006188939,0.0005454195,0.04940474,0.1329488,0.0148147,0.1230789,0.01555777,0.6591635],"study_design_scores_gemma":[0.0008430866,0.0006625776,0.0002789371,0.000156269,0.00002236109,0.000457122,0.002101063,0.9631181,0.01427741,0.0007470546,0.01652657,0.0008094676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01274279,0.0001138344,0.9850532,0.0001452509,0.0001367679,0.0003186395,0.00003461481,0.0006233988,0.0008315054],"genre_scores_gemma":[0.1386667,0.0000891435,0.8609804,0.00009145145,0.00004576883,0.00002782693,0.00003940216,0.00001102756,0.00004834913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8301693,"threshold_uncertainty_score":0.5738456,"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."}}