{"id":"W4206241082","doi":"10.1089/cmb.2021.0436","title":"flopp: Extremely Fast Long-Read Polyploid Haplotype Phasing by Uniform Tree Partitioning","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Polyploid; Phaser; Haplotype; Probabilistic logic; Ploidy; Computer science; Algorithm; Tree (set theory); Metric (unit); Biology; Biological system; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence; Genetics; Physics; Genotype","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.0002405714,0.0001138413,0.0001784067,0.00007004767,0.0002440039,0.00001431705,0.0001821898,0.00004737079,0.00009505727],"category_scores_gemma":[0.00003258982,0.0001085212,0.0001104953,0.00007877724,0.00007698806,0.000001811822,0.0001304035,0.0001318897,0.000002437624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003261486,"about_ca_system_score_gemma":0.0001283605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000625935,"about_ca_topic_score_gemma":0.000007536528,"domain_scores_codex":[0.9991078,0.00007438753,0.0003589356,0.0001523552,0.0001298729,0.0001766843],"domain_scores_gemma":[0.9993485,0.00004374532,0.0003043459,0.00007466755,0.0001696887,0.0000590234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006125442,0.0003453867,0.02874369,0.00001128597,0.0006505352,0.00001527294,0.0002385239,0.08546209,0.8393736,0.00106271,0.01404711,0.02943723],"study_design_scores_gemma":[0.00953021,0.01274056,0.1267991,0.00004756225,0.0003108677,0.003369865,0.001492853,0.004983252,0.0484505,0.03383571,0.7567124,0.001727103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9824707,0.004062973,0.01159515,0.0006991301,0.0004507157,0.00005972938,0.00007704329,0.000002500917,0.00058206],"genre_scores_gemma":[0.9972497,0.0000973795,0.001633567,0.000344239,0.0002861948,0.000004601939,0.0001493942,0.00001334975,0.0002216079],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7909231,"threshold_uncertainty_score":0.4425365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01371482604550095,"score_gpt":0.2547400289230975,"score_spread":0.2410252028775965,"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."}}