{"id":"W2951833220","doi":"10.1007/978-1-4939-2864-4_73","title":"Closest String and Substring Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Substring; Combinatorics; Hamming distance; String (physics); Approximate string matching; String searching algorithm; Mathematics; Edit distance; Discrete mathematics; Logarithm; Set (abstract data type); Algorithm; Pattern matching; Computer science; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003029317,0.0004722759,0.000584242,0.0002581508,0.0001229059,0.00008814059,0.001082764,0.0003304941,0.0000716206],"category_scores_gemma":[0.00002746441,0.0003741751,0.0001248373,0.00006222987,0.0001401163,0.0006626847,0.001153937,0.0003756867,0.00005512629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000561001,"about_ca_system_score_gemma":0.0001445036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002415686,"about_ca_topic_score_gemma":0.000003929599,"domain_scores_codex":[0.9974698,0.00001825321,0.0006249187,0.0008507772,0.0005763111,0.0004599561],"domain_scores_gemma":[0.9979594,0.0001838073,0.0004809215,0.0009890936,0.0001353851,0.0002513903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003460238,0.00002239375,0.00005898633,0.000121439,0.00005960287,0.00005075601,0.0001874155,0.00000394557,0.00003013894,0.1807313,0.0009591761,0.8177714],"study_design_scores_gemma":[0.0009351842,0.0002685435,0.0004121302,0.001869459,0.00005816273,0.00008314497,0.000006503618,0.002013249,0.0001913819,0.07766221,0.9152496,0.001250475],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00006318871,0.004881422,0.2271031,0.0001790455,0.001434755,0.000529311,0.0001324186,0.0002558025,0.765421],"genre_scores_gemma":[0.001169392,0.03699571,0.2238005,0.00008965335,0.002586709,0.00005026513,0.00008160127,0.0002459774,0.7349802],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9142904,"threshold_uncertainty_score":0.999871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01393923514751617,"score_gpt":0.2182260767107492,"score_spread":0.204286841563233,"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."}}