{"id":"W2131619859","doi":"10.1186/1471-2105-7-29","title":"Recrafting the neighbor-joining method","year":2006,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Phylogenetic tree; Implementation; Construct (python library); k-nearest neighbors algorithm; Algorithm; Running time; Data mining; Theoretical computer science; Artificial intelligence; Biology","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.003889175,0.001169638,0.001019419,0.002328489,0.001415749,0.002308585,0.003599958,0.001260554,0.01603894],"category_scores_gemma":[0.01754506,0.0007073514,0.001151282,0.003370932,0.001031671,0.002640068,0.002747955,0.00231111,0.01449514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006627786,"about_ca_system_score_gemma":0.00219362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001767497,"about_ca_topic_score_gemma":0.002092616,"domain_scores_codex":[0.9949571,0.001681031,0.0004088113,0.001078916,0.001606579,0.0002674977],"domain_scores_gemma":[0.9903399,0.003601471,0.0006154067,0.003002116,0.002164105,0.0002769723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003043113,0.0002115949,0.004185626,0.0009578773,0.0001925591,0.0003637777,0.0006917798,0.04395244,0.009513987,0.08806539,0.02982163,0.821739],"study_design_scores_gemma":[0.0001479825,0.0002289722,0.001835548,0.000344921,0.0001422524,0.002600707,0.0005954014,0.4114147,0.0285575,0.216633,0.3373597,0.0001392806],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003804323,0.000451743,0.9862908,0.0001610005,0.000124288,0.0001781566,0.0003255477,0.002820767,0.005843445],"genre_scores_gemma":[0.0370813,0.0004801328,0.9560233,0.0001093914,0.00007693019,0.0002921368,0.001246509,0.0009075041,0.003782838],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01603894,"threshold_uncertainty_score":0.05365562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01589573064061521,"score_gpt":0.2535508975119469,"score_spread":0.2376551668713317,"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."}}