{"id":"W2110922051","doi":"10.1186/1748-7188-7-32","title":"Towards a practical O(n logn) phylogeny algorithm","year":2012,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Phylogenetics; Algorithm; Biology","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006494165,0.0003304472,0.0003761206,0.000149341,0.0002012829,0.00008506182,0.0009356121,0.0003082396,0.00002558002],"category_scores_gemma":[0.0001779738,0.0002799143,0.0002232946,0.0003304516,0.0001289324,0.0005873966,0.00076842,0.0002443362,0.000103935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000537744,"about_ca_system_score_gemma":0.0001379028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005719999,"about_ca_topic_score_gemma":6.134592e-7,"domain_scores_codex":[0.9974676,0.0001733094,0.0003727595,0.0006847086,0.0002259792,0.0010756],"domain_scores_gemma":[0.9982035,0.0001606503,0.0001571405,0.0009360499,0.0001726386,0.0003700792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001231951,0.000337346,0.00008892964,0.00001166758,0.0001119286,0.00003066909,0.0001315952,0.000003552621,0.0140123,0.2078397,0.002134272,0.7752858],"study_design_scores_gemma":[0.003240959,0.001695218,0.001416097,0.00003315489,0.0001341092,0.001099599,0.00007866615,0.2677464,0.0779603,0.08859631,0.5559506,0.002048647],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006464815,0.001226355,0.9941287,0.001044079,0.001673306,0.0004630539,0.00009092841,0.0002142037,0.0005128845],"genre_scores_gemma":[0.02175312,0.00003961734,0.9757945,0.001382699,0.0005919621,0.0001819108,0.0001580138,0.00003363105,0.00006453508],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7732371,"threshold_uncertainty_score":0.9999653,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03332692126473845,"score_gpt":0.3493959329378441,"score_spread":0.3160690116731056,"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."}}