{"id":"W2534763950","doi":"10.4230/lipics.cpm.2016.14","title":"Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tree (set theory); Binary tree; Computer science; Function (biology); K-ary tree; Time complexity; Gene; Algorithm; Mathematics; Tree structure; Computational biology; Biology; Combinatorics; Genetics","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.002447924,0.001282744,0.002103758,0.001744572,0.001201662,0.00199736,0.003981882,0.002683945,0.007387564],"category_scores_gemma":[0.0100441,0.0007063067,0.001470295,0.002840634,0.00101766,0.004225793,0.002524188,0.001740636,0.001643572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001208253,"about_ca_system_score_gemma":0.001935008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002854036,"about_ca_topic_score_gemma":0.003949393,"domain_scores_codex":[0.9982399,0.0006630589,0.0001067965,0.0004283084,0.0003372972,0.0002248148],"domain_scores_gemma":[0.9929253,0.004344285,0.0004732037,0.001488563,0.0005583662,0.0002103226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008176189,0.000408653,0.002447878,0.0004833631,0.0001918318,0.0002802618,0.0004193739,0.5183864,0.01107513,0.0232772,0.009244312,0.4329679],"study_design_scores_gemma":[0.0001034636,0.00007695144,0.0004982954,0.00001347855,0.00004275504,0.0001331514,0.00007285498,0.9750665,0.003097578,0.01936734,0.00150428,0.00002340235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1137036,0.0008032153,0.8763143,0.0006536829,0.0001136773,0.0002605556,0.0005310151,0.004245258,0.003374665],"genre_scores_gemma":[0.297765,0.0001775611,0.6956347,0.0001869139,0.00006768942,0.0003001358,0.002006769,0.0008438096,0.003017519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007387564,"threshold_uncertainty_score":0.02471381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01070809377943325,"score_gpt":0.2379367081829139,"score_spread":0.2272286144034806,"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."}}