{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004236374,0.0003565208,0.0003288699,0.0000628569,0.000323817,0.0001909068,0.0006963335,0.0001255316,0.00003395195],"category_scores_gemma":[0.00004507813,0.0002403567,0.00008561919,0.00006173884,0.003653083,0.000002845224,0.0008833984,0.0002470844,0.000007012778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001968999,"about_ca_system_score_gemma":0.00003981792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001462182,"about_ca_topic_score_gemma":0.00001089442,"domain_scores_codex":[0.9983827,0.00001870726,0.0003418621,0.0006136026,0.0002795191,0.00036354],"domain_scores_gemma":[0.9990066,0.0001154092,0.0001133365,0.0006095401,0.00005999916,0.00009516839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000331254,0.00001587683,0.000005946029,0.00003535006,0.00001842796,0.00000552948,0.0003868277,0.00005132478,0.0001726466,0.9945964,0.00003085422,0.00464774],"study_design_scores_gemma":[0.0003033546,0.0007451238,0.0001246514,0.0004513755,0.00003119366,0.00005259888,0.00006399327,0.01216155,0.000570097,0.970132,0.01466853,0.0006955707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1674054,0.003872427,0.05234484,0.001962501,0.001339209,0.001873863,0.0003019696,0.00003800002,0.7708619],"genre_scores_gemma":[0.9914299,0.0009556997,0.005225864,0.0004074805,0.0002511816,0.000009545773,0.0000142416,0.00004902393,0.001657094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8240245,"threshold_uncertainty_score":0.9990584,"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."}}