{"id":"W2047386086","doi":"10.1145/506147.506150","title":"On the closest string and substring problems","year":2002,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Substring; Hamming distance; Combinatorics; String (physics); Approximate string matching; Mathematics; String searching algorithm; String metric; Edit distance; Discrete mathematics; Set (abstract data type); Computer science; Algorithm; Pattern matching; Artificial intelligence","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.0003362756,0.00004801954,0.00006303655,0.00002447455,0.0001568055,0.0001315655,0.002029828,0.00001498877,0.00001013617],"category_scores_gemma":[0.0002874046,0.00002025819,0.00003801023,0.0001008479,0.00001782529,0.0002583225,0.0008172501,0.0002026585,0.000004395015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001385439,"about_ca_system_score_gemma":0.000006827659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003278549,"about_ca_topic_score_gemma":5.497822e-7,"domain_scores_codex":[0.9994441,0.00003951869,0.0001356554,0.00006282618,0.0002165239,0.0001013997],"domain_scores_gemma":[0.9988925,0.0001835498,0.0001652877,0.0006920411,0.00002903083,0.00003758422],"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.00003772558,0.0005459099,0.01367378,0.00006278468,0.000201363,0.0001420923,0.006269922,0.006943602,0.01118348,0.1155013,0.2071373,0.6383007],"study_design_scores_gemma":[0.003642634,0.0012968,0.1415029,0.002753377,0.00008861007,0.002851995,0.0003020833,0.3028559,0.02184817,0.4132554,0.1086545,0.0009475606],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9546607,0.00121018,0.01802999,0.02440606,0.0008676545,0.0001137391,9.613982e-7,0.00001600886,0.0006947476],"genre_scores_gemma":[0.9947934,0.00009733003,0.004653426,0.0002485104,0.0001123749,3.400501e-7,1.244884e-8,0.000002685344,0.00009197501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6373531,"threshold_uncertainty_score":0.3771958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03950130813966558,"score_gpt":0.2181354447543569,"score_spread":0.1786341366146914,"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."}}