{"id":"W2151781607","doi":"10.1093/bioinformatics/btu463","title":"Polytomy refinement for the correction of dubious duplications in gene trees","year":2014,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Source code; Tree (set theory); Computer science; Heuristic; Ensembl; Set (abstract data type); Bounded function; Gene duplication; Graph; Feature (linguistics); Binary tree; Code (set theory); Software; Theoretical computer science; Gene; Data mining; Algorithm; Artificial intelligence; Biology; Mathematics; Combinatorics; Genetics; Genomics; Programming language; Genome","routes":{"ca_aff":true,"ca_fund":true,"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.0003016799,0.00009039371,0.0001043136,0.00003910967,0.00006900889,0.00001449206,0.0001708334,0.00008731404,0.000003688285],"category_scores_gemma":[0.0000583955,0.00006573275,0.00006612594,0.00008201348,0.00004988589,0.000004330822,0.00005246887,0.00004576383,0.000004143871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001113812,"about_ca_system_score_gemma":0.00003236148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001695443,"about_ca_topic_score_gemma":0.00009716926,"domain_scores_codex":[0.9993075,0.00000850431,0.0003971264,0.00006659258,0.00006944282,0.0001507987],"domain_scores_gemma":[0.999357,0.00004389363,0.0001788542,0.0003335767,0.00005896695,0.00002769204],"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.0004179034,0.0003854313,0.003657839,0.0003880848,0.0003315875,1.261732e-7,0.002528473,0.03292533,0.06129936,0.008699703,0.09087137,0.7984948],"study_design_scores_gemma":[0.001507692,0.0004946953,0.004982795,0.00003162217,0.00004743079,0.000009400056,0.0005564128,0.697333,0.04421376,0.0002781458,0.2502573,0.0002877473],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.169388,0.0007379217,0.8151286,0.0009647384,0.001225295,0.001658791,0.0000959727,0.0000271236,0.01077361],"genre_scores_gemma":[0.9860684,0.0001888682,0.01254207,0.0003569156,0.000153755,0.00007876699,0.0001672692,0.00001036756,0.000433584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8166804,"threshold_uncertainty_score":0.2680504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008654429824636958,"score_gpt":0.2304354315406671,"score_spread":0.2217810017160302,"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."}}