{"id":"W2940808208","doi":"10.1186/s13015-019-0139-6","title":"Reconciling multiple genes trees via segmental duplications and losses","year":2019,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Gene duplication; Segmental duplication; Tree (set theory); Genome; Gene; Set (abstract data type); Time complexity; Computer science; Computational biology; Biology; Gene family; Algorithm; Mathematics; Genetics; 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.00009467026,0.0001713225,0.0001826219,0.00003614863,0.00009565891,0.00001380505,0.0001332141,0.0001459801,0.000005898137],"category_scores_gemma":[0.00003271383,0.0001649528,0.00009746581,0.00004016004,0.0001026656,9.285502e-7,0.000138073,0.00003846356,0.000007235656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008062449,"about_ca_system_score_gemma":0.00002668097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003177261,"about_ca_topic_score_gemma":0.00004149898,"domain_scores_codex":[0.999031,0.00002837544,0.0001808065,0.0004677966,0.0000333101,0.0002587025],"domain_scores_gemma":[0.9994857,0.00003533521,0.00006690693,0.0002794072,0.00007523777,0.00005745687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002397339,0.00002385712,0.02007599,0.000009504917,0.0001266372,3.866364e-7,0.00001854979,0.00004003602,0.9598296,0.0001484406,0.00003441048,0.01966866],"study_design_scores_gemma":[0.001651266,0.001069625,0.008309515,0.000006572647,0.00006103853,0.0000505643,0.0001370536,0.002003531,0.9283919,0.001381405,0.05642706,0.0005105014],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9590185,0.006628571,0.03322255,0.0001626261,0.0002203754,0.0005117115,0.0001160477,0.000006704778,0.0001129271],"genre_scores_gemma":[0.9807357,0.0005625137,0.01773791,0.0003033185,0.0001224784,0.0001241062,0.0002449737,0.00002723183,0.0001417271],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05639265,"threshold_uncertainty_score":0.6726581,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01218585346680486,"score_gpt":0.2636286312657858,"score_spread":0.251442777798981,"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."}}