{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002556306,0.0009582644,0.001217516,0.002328378,0.001026452,0.001395207,0.002536112,0.001880673,0.004226142],"category_scores_gemma":[0.008709886,0.0007525162,0.002019647,0.002265288,0.001243904,0.001565275,0.002626511,0.001795292,0.0007409447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181078,"about_ca_system_score_gemma":0.002039082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004149372,"about_ca_topic_score_gemma":0.004646865,"domain_scores_codex":[0.9989164,0.0003302196,0.00006483232,0.000208972,0.000379721,0.00009993506],"domain_scores_gemma":[0.9959325,0.00283485,0.0002727875,0.0003236896,0.0004822554,0.0001539009],"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.0001527375,0.00008474311,0.002269883,0.0002161871,0.0001233537,0.0001570961,0.0002399572,0.830242,0.004002784,0.02626211,0.002425451,0.1338238],"study_design_scores_gemma":[0.00002169781,0.00001516574,0.000197433,0.000009324957,0.000008944988,0.00005157754,0.00001226569,0.98874,0.0004060821,0.009801767,0.0007268895,0.000008838784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01015159,0.0001408264,0.9882528,0.00009354251,0.00001471977,0.0000677907,0.0001263326,0.0006259413,0.0005265313],"genre_scores_gemma":[0.09630784,0.0001186939,0.901629,0.00008227261,0.00003342481,0.0002991575,0.0006295584,0.0002832288,0.0006168746],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004226142,"threshold_uncertainty_score":0.01413786,"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."}}