{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002477433,0.00093298,0.001274426,0.001289409,0.001175694,0.0008290364,0.002488552,0.001547588,0.004792721],"category_scores_gemma":[0.01222745,0.0006241606,0.001331883,0.00122774,0.001974987,0.001801315,0.002079811,0.002239578,0.001369097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001264552,"about_ca_system_score_gemma":0.001865474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003562063,"about_ca_topic_score_gemma":0.006846643,"domain_scores_codex":[0.9987797,0.0003155342,0.00006983759,0.0003964035,0.0002921135,0.0001463506],"domain_scores_gemma":[0.9926332,0.004416415,0.0006520225,0.001460453,0.0006176563,0.0002202169],"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.0006056337,0.0002497119,0.008771572,0.0005925709,0.0001444329,0.0005230567,0.0009095615,0.5884967,0.02916142,0.03841831,0.009631176,0.3224958],"study_design_scores_gemma":[0.00008899706,0.0001007927,0.001073439,0.000057238,0.00006169827,0.000357186,0.0001426867,0.9281074,0.01253632,0.0526391,0.0048052,0.00002991831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06009014,0.000338263,0.9337361,0.0004534262,0.00007506816,0.0001442601,0.0001934021,0.002968848,0.002000483],"genre_scores_gemma":[0.1550146,0.0000991132,0.8421383,0.0001704331,0.00002358113,0.0001232897,0.0004523801,0.0008115653,0.001166665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004792721,"threshold_uncertainty_score":0.01603323,"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."}}