{"id":"W2170748243","doi":"10.1109/tcbb.2011.64","title":"An Efficient Method for Exploring the Space of Gene Tree/Species Tree Reconciliations in a Probabilistic Framework","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Tree (set theory); Probabilistic logic; Computer science; Subspace topology; Set (abstract data type); Posterior probability; Data mining; Algorithm; Computational biology; Biology; Artificial intelligence; Mathematics; Combinatorics","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.0003331808,0.000131324,0.0001508022,0.0001138266,0.000135218,0.000009885416,0.0001789185,0.0001138962,0.000008606743],"category_scores_gemma":[0.00006479202,0.0001008486,0.00006935011,0.0001469582,0.0001392929,0.000009896001,0.000005569945,0.0001035096,0.000001602108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001716874,"about_ca_system_score_gemma":0.00005721333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001028942,"about_ca_topic_score_gemma":0.00006106393,"domain_scores_codex":[0.9991826,0.0000705902,0.0003412145,0.0001711498,0.00007244966,0.0001619558],"domain_scores_gemma":[0.9992486,0.000241366,0.0001095423,0.0002393311,0.0001191393,0.00004197306],"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.001061152,0.001757259,0.002193168,0.0003764786,0.0005751498,0.000001152439,0.01764276,0.6864787,0.03518808,0.01307241,0.00006791999,0.2415858],"study_design_scores_gemma":[0.003348294,0.00470378,0.03870799,0.0001195864,0.0002466005,0.0000485394,0.005351533,0.8092762,0.1016543,0.03449601,0.001079637,0.0009674697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1666359,0.00004025095,0.8323986,0.0001420811,0.0001954362,0.0003948268,0.0001021495,0.000009046726,0.00008169183],"genre_scores_gemma":[0.5210516,0.00004117609,0.4785977,0.00005738691,0.00003326121,0.0001227131,0.00007252691,0.000006880397,0.00001672294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3544157,"threshold_uncertainty_score":0.4112486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05947419300127574,"score_gpt":0.29739306547873,"score_spread":0.2379188724774543,"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."}}