{"id":"W2062088872","doi":"10.1016/s0304-3975(03)00320-7","title":"On the complexity of finding common approximate substrings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"","keywords":"Parameterized complexity; Substring; Mathematics; Hamming distance; Combinatorics; String (physics); Alphabet; Time complexity; Class (philosophy); Set (abstract data type); Discrete mathematics; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002097341,0.0001642094,0.0002141353,0.000111941,0.0005797211,0.0002619541,0.003017521,0.00003594176,0.00005643412],"category_scores_gemma":[0.0001429449,0.000098845,0.00006264605,0.001005921,0.004654746,0.0004030977,0.0009142865,0.0002347593,0.00002910773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000326789,"about_ca_system_score_gemma":0.00006528501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000431502,"about_ca_topic_score_gemma":2.103298e-7,"domain_scores_codex":[0.9977658,0.0001996042,0.0002844972,0.0005228631,0.0007708225,0.0004564564],"domain_scores_gemma":[0.997826,0.0005665171,0.0001182056,0.001234777,0.0001058177,0.0001487263],"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.000003539267,0.00005778967,0.00003184768,0.000004064445,0.000001787631,0.000002665444,0.000163006,0.00008708331,0.0003233095,0.9951737,0.00006286705,0.004088358],"study_design_scores_gemma":[0.0001154331,0.0001133747,0.0004588836,0.00003633553,0.000001557996,0.00001479934,0.000005167626,0.3837354,0.02006167,0.5952766,0.00006201465,0.0001188075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08388761,0.00001135196,0.9089831,0.0006208746,0.0003363203,0.0001529152,0.000002789103,0.00007982639,0.005925241],"genre_scores_gemma":[0.9017961,0.000001532234,0.09781813,0.0003542594,0.00001849711,0.000003500553,5.026396e-7,0.000004559984,0.000002931713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8179085,"threshold_uncertainty_score":0.998054,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03818003502775003,"score_gpt":0.2685853574314501,"score_spread":0.2304053224037,"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."}}