{"id":"W2805555771","doi":"10.1186/s12862-018-1163-8","title":"A new fast method for inferring multiple consensus trees using k-medoids","year":2018,"lang":"en","type":"article","venue":"BMC Evolutionary Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Phylogenetic tree; Concatenation (mathematics); Phylogenetic network; Tree rearrangement; Tree (set theory); Biology; Cluster analysis; Phylogenetics; Horizontal gene transfer; Set (abstract data type); Phylogenomics; Evolutionary biology; Computational biology; Gene; Computer science; Artificial intelligence; Genetics; Mathematics; Combinatorics; Clade","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.0001548729,0.0001746686,0.0001926656,0.00005245128,0.0002173827,0.000006313113,0.0001497608,0.0001911319,0.00001358382],"category_scores_gemma":[0.0002258272,0.000166693,0.0001205625,0.00006282907,0.0001863525,5.22379e-7,0.0001740903,0.00004063361,0.000006777198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002281723,"about_ca_system_score_gemma":0.0002425211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002231465,"about_ca_topic_score_gemma":0.0005594161,"domain_scores_codex":[0.9988946,0.00008689456,0.0002280113,0.0004190892,0.00003634825,0.0003351115],"domain_scores_gemma":[0.999326,0.0001046185,0.00008962783,0.0002495848,0.0001487381,0.00008142697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002082791,0.00002296714,0.07834204,0.00000843715,0.00009726179,2.083232e-7,0.00004175361,0.0003101114,0.9151271,0.0006765616,0.00234581,0.00281946],"study_design_scores_gemma":[0.007122613,0.004255554,0.2651506,0.00004101327,0.000233112,0.0003012904,0.0006009847,0.07352562,0.1710254,0.01279245,0.4632054,0.001746012],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5024045,0.002059328,0.494282,0.0000788957,0.0004926641,0.0002771746,0.0001158164,0.000009210526,0.000280426],"genre_scores_gemma":[0.606562,0.00002103329,0.3918583,0.0001063286,0.001073349,0.00002040996,0.00005905741,0.00001650317,0.0002830295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7441018,"threshold_uncertainty_score":0.6797542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04101743568980019,"score_gpt":0.321671346539846,"score_spread":0.2806539108500458,"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."}}