{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003486773,0.0001313381,0.0001086553,0.00002047456,0.0002006012,0.00004563165,0.000194475,0.000077235,0.000005495635],"category_scores_gemma":[0.00006144223,0.00009012804,0.00008604056,0.00007697949,0.00004750373,0.000001063051,0.0001547019,0.00006560694,0.00001813314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006824067,"about_ca_system_score_gemma":0.00004563341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002853521,"about_ca_topic_score_gemma":0.00005422145,"domain_scores_codex":[0.9992318,0.00003312154,0.000296346,0.0001123258,0.00009673926,0.0002296532],"domain_scores_gemma":[0.9994381,0.0000460861,0.000124431,0.0003115902,0.00005329408,0.00002647601],"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.0002579874,0.000286168,0.1640092,0.0006207845,0.0006964309,0.000004673725,0.003952943,0.06169935,0.4629976,0.0259184,0.1329374,0.1466189],"study_design_scores_gemma":[0.001575318,0.0003702635,0.0508053,0.00004259234,0.00013513,0.000105983,0.003011167,0.1480772,0.06650617,0.002591247,0.7256762,0.001103372],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2598333,0.003012619,0.6265814,0.0005362432,0.0006821942,0.0006281301,0.00005070307,0.00003170462,0.1086437],"genre_scores_gemma":[0.3248511,0.0001317489,0.6717126,0.001027662,0.0007823223,0.00003245184,0.00006667322,0.00003241837,0.001363071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5927388,"threshold_uncertainty_score":0.3675315,"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."}}