{"id":"W61744817","doi":"10.1007/978-3-642-33293-7_24","title":"Enumerating Neighbour and Closest Strings","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; String (physics); Alphabet; Combinatorics; Mathematics; Enumeration; Constant (computer programming); Running time; String searching algorithm; Upper and lower bounds; Commentz-Walter algorithm; Discrete mathematics; Algorithm; Pattern matching; Computer science; Mathematical analysis","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.0006506875,0.0004461964,0.000408428,0.0004179769,0.0003625145,0.0007965066,0.002057817,0.0003503143,0.00002344379],"category_scores_gemma":[0.00005132873,0.0003849706,0.00006124761,0.0002844479,0.0003788074,0.001301539,0.00265883,0.000969056,0.00002987336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001090978,"about_ca_system_score_gemma":0.0002142617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003596145,"about_ca_topic_score_gemma":0.00001378713,"domain_scores_codex":[0.9970026,0.00002312749,0.0003891198,0.001208782,0.0007256515,0.0006507025],"domain_scores_gemma":[0.9979837,0.000317626,0.0002436549,0.00108829,0.0001169317,0.0002498238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001231583,0.00001170526,0.00007923717,0.00001958143,0.0000038627,0.00002619753,0.0003413122,0.0005406046,0.0001146968,0.03301488,0.00001653408,0.9658301],"study_design_scores_gemma":[0.0005163655,0.0002364116,0.001108179,0.0008940325,0.00001611429,0.0003229834,2.975813e-7,0.8325869,0.001747875,0.1448558,0.01609973,0.001615333],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001192056,0.002396706,0.9936188,0.0004123246,0.001241542,0.0002015059,0.000006865202,0.0001232076,0.001879833],"genre_scores_gemma":[0.137109,0.0003292274,0.8595389,0.001417723,0.001286366,0.000006578083,0.000009347321,0.00004298459,0.0002598411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9642148,"threshold_uncertainty_score":0.9998602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01496411282955636,"score_gpt":0.2373594837674487,"score_spread":0.2223953709378923,"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."}}