{"id":"W2964036832","doi":"10.4230/lipics.wabi.2018.5","title":"Reconciling Multiple Genes Trees via Segmental Duplications and Losses","year":2018,"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":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Lambda; Tree (set theory); Gene duplication; Genome; Segmental duplication; Set (abstract data type); Time complexity; Gene; Combinatorics; Computer science; Biology; Computational complexity theory; Mathematics; Computational biology; Algorithm; Genetics; Gene family; Physics","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.002248912,0.0008505216,0.001228692,0.002566249,0.001243884,0.001489165,0.001757078,0.001401213,0.002182795],"category_scores_gemma":[0.008503122,0.0007114883,0.001490174,0.002612046,0.0009578719,0.003362698,0.002187388,0.001647913,0.0007672358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003153,"about_ca_system_score_gemma":0.0009980462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001321368,"about_ca_topic_score_gemma":0.001981811,"domain_scores_codex":[0.9987404,0.0003554076,0.00008545872,0.0004686426,0.0002403618,0.0001097264],"domain_scores_gemma":[0.9960335,0.002346762,0.0004180364,0.0007997656,0.0002609002,0.0001410705],"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.001454438,0.0002189778,0.03642574,0.0007704768,0.0005832772,0.00220418,0.001853671,0.4261546,0.0514239,0.05008554,0.01018084,0.4186443],"study_design_scores_gemma":[0.00008924839,0.0001324792,0.007535405,0.00007550871,0.0001942966,0.001179575,0.0007149301,0.8309272,0.02313251,0.123783,0.01216931,0.00006664065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3667753,0.00134705,0.6231863,0.001187727,0.00009125619,0.0001349752,0.001619835,0.003679715,0.001977898],"genre_scores_gemma":[0.6082814,0.0004220733,0.3834709,0.0002586148,0.00006695071,0.0001104097,0.005172736,0.000693271,0.001523791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002566249,"threshold_uncertainty_score":0.01189351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01349112435481893,"score_gpt":0.2458392295529327,"score_spread":0.2323481051981138,"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."}}