{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142515,0.0008285709,0.0009211865,0.0007330239,0.0006041592,0.0009096941,0.001697949,0.00131261,0.002096814],"category_scores_gemma":[0.006183506,0.0006749131,0.0009441313,0.001051437,0.0006522692,0.00194977,0.001999941,0.00151312,0.0007542429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004990513,"about_ca_system_score_gemma":0.001050303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002427352,"about_ca_topic_score_gemma":0.00418068,"domain_scores_codex":[0.9994373,0.0001839637,0.00003433797,0.0001917254,0.0001143267,0.00003833436],"domain_scores_gemma":[0.9982033,0.001136044,0.0001663278,0.0002845531,0.0001415042,0.0000683274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004836765,0.0001085447,0.004023815,0.0005522224,0.0003819455,0.0003838494,0.0004959475,0.468805,0.0470065,0.03265849,0.01057447,0.4345254],"study_design_scores_gemma":[0.0000529697,0.00005699911,0.000649328,0.00001865744,0.00001848367,0.0001946574,0.00004039958,0.9598082,0.009713011,0.02578315,0.003635175,0.00002906159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008943707,0.0001641132,0.9886903,0.00007491898,0.00001925413,0.00003151226,0.0001802801,0.001573031,0.0003228166],"genre_scores_gemma":[0.09301849,0.0001425787,0.9039486,0.0001417534,0.00002834775,0.0001813,0.001046818,0.0006109667,0.0008811847],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002427352,"threshold_uncertainty_score":0.007537007,"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."}}