{"id":"W2072234624","doi":"10.1109/isit.2013.6620505","title":"Optimal DNA shotgun sequencing: Noisy reads are as good as noiseless reads","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Shotgun sequencing; DNA sequencing; Computer science; Shotgun; Noise (video); Sequence (biology); DNA; Channel (broadcasting); Algorithm; Computational biology; Biology; Genetics; Artificial intelligence; Computer network; Gene","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005296788,0.000875115,0.0009515317,0.0002926838,0.0003098154,0.001467826,0.00527446,0.0008528488,0.0007320012],"category_scores_gemma":[0.00009480226,0.0007250152,0.0003114829,0.0003603964,0.000120344,0.001165426,0.01018733,0.001396335,0.002409263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003438713,"about_ca_system_score_gemma":0.0009273709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003696651,"about_ca_topic_score_gemma":0.0000374669,"domain_scores_codex":[0.9945989,0.000183505,0.0008206175,0.002264722,0.001208607,0.0009235956],"domain_scores_gemma":[0.9940099,0.0001438043,0.0006292196,0.004154202,0.0004921931,0.0005707094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001331861,0.001457673,0.001311456,0.001439165,0.0008656681,0.002617926,0.0061963,0.02478416,0.00890763,0.5563291,0.2586539,0.1373038],"study_design_scores_gemma":[0.001692564,0.0007558595,0.002428108,0.002440607,0.0001701165,0.0008261001,0.000719302,0.8033357,0.03087509,0.04837901,0.1024306,0.005946916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1469035,0.0005436031,0.6985052,0.002721495,0.004650071,0.001624917,0.0001441168,0.002149024,0.142758],"genre_scores_gemma":[0.2986998,0.000485546,0.653255,0.0029521,0.001908448,0.0004986639,0.0006903398,0.0002075178,0.04130252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7785515,"threshold_uncertainty_score":0.9995688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02801162172109875,"score_gpt":0.2691731575295082,"score_spread":0.2411615358084094,"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."}}