{"id":"W1531547509","doi":"10.1090/dimacs/055/09","title":"On computing the nearest neighbor interchange distance","year":2000,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"k-nearest neighbors algorithm; Computer science; Nearest neighbor search; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451414,0.001359771,0.002564995,0.003196978,0.00185081,0.002702356,0.004049787,0.002310342,0.005448278],"category_scores_gemma":[0.02197619,0.000572596,0.001448124,0.00553706,0.001657802,0.006934296,0.003891293,0.003549027,0.003471753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002227175,"about_ca_system_score_gemma":0.001912076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005006228,"about_ca_topic_score_gemma":0.00492171,"domain_scores_codex":[0.9939492,0.001266884,0.0003879458,0.001214188,0.002794185,0.0003876705],"domain_scores_gemma":[0.9933971,0.003235741,0.0005538224,0.001275245,0.001306429,0.0002316078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007019392,0.0002946044,0.004186301,0.0004637281,0.0001938077,0.0002645256,0.0003831805,0.2611492,0.00410929,0.1486072,0.01711447,0.5625318],"study_design_scores_gemma":[0.00005295725,0.0001593573,0.0009052064,0.0000721754,0.0000384793,0.0004040016,0.0001607763,0.7538167,0.003014614,0.2280261,0.01327744,0.00007223021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02042662,0.002007984,0.9684257,0.0006733228,0.0002793773,0.0001427257,0.0005008386,0.0009498955,0.006593633],"genre_scores_gemma":[0.1691844,0.001550171,0.8198995,0.00061318,0.0003243654,0.0002957012,0.002603593,0.0003238197,0.005205316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005448278,"threshold_uncertainty_score":0.01822633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009468099680436316,"score_gpt":0.2323020704692751,"score_spread":0.2228339707888388,"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."}}