{"id":"W2749142859","doi":"10.4230/lipics.wabi.2017.8","title":"A General Framework for Gene Tree Correction Based on Duplication-Loss Reconciliation","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Supertree; Tree (set theory); Phylogenetic tree; Computer science; Set (abstract data type); Binary tree; K-ary tree; Gene duplication; Interval tree; Algorithm; Tree structure; Mathematics; Theoretical computer science; Combinatorics; Biology; Gene","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.006658007,0.002142926,0.00284118,0.004072031,0.002158378,0.004058077,0.007485854,0.004226804,0.006681281],"category_scores_gemma":[0.008977276,0.001151048,0.004422359,0.004309451,0.003820665,0.004331539,0.005753535,0.005578166,0.002380959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002557426,"about_ca_system_score_gemma":0.002998295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003070161,"about_ca_topic_score_gemma":0.002838083,"domain_scores_codex":[0.9949438,0.001662546,0.0003214604,0.001299301,0.0014087,0.0003642804],"domain_scores_gemma":[0.9972523,0.001234557,0.0002834796,0.0006587516,0.0004382727,0.0001325304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008528449,0.00008722157,0.0004997236,0.0005090093,0.0001403715,0.0006566501,0.0004517487,0.1920053,0.00538602,0.6945845,0.006032493,0.09956177],"study_design_scores_gemma":[0.00004300122,0.00009044264,0.0002442135,0.0000954213,0.00006419518,0.0005386509,0.00007896006,0.4003363,0.002238481,0.5717856,0.02441191,0.0000728978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005180705,0.0002938151,0.9975188,0.0002243026,0.00004737989,0.00006494315,0.00005650462,0.0002720398,0.00100425],"genre_scores_gemma":[0.03452915,0.0009038018,0.959538,0.0003181687,0.0002918686,0.0003612696,0.0004314306,0.0004175347,0.003208844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007485854,"threshold_uncertainty_score":0.03521132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01744341892311502,"score_gpt":0.2768385683036587,"score_spread":0.2593951493805436,"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."}}