{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005533181,0.001451468,0.00385804,0.003767606,0.002644625,0.009095035,0.005657472,0.004189966,0.01481741],"category_scores_gemma":[0.07686041,0.001399369,0.002431808,0.009220825,0.004456945,0.023567,0.006913591,0.004688996,0.001804125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004456043,"about_ca_system_score_gemma":0.003866661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006744414,"about_ca_topic_score_gemma":0.007841233,"domain_scores_codex":[0.9886497,0.002532762,0.001115217,0.002075804,0.004553681,0.001072685],"domain_scores_gemma":[0.8172253,0.163465,0.004739862,0.009091857,0.003809384,0.001668783],"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.0061791,0.000856752,0.01762154,0.001967466,0.0005411471,0.00112287,0.002321393,0.3579301,0.008853751,0.1951792,0.03507376,0.3723528],"study_design_scores_gemma":[0.0002996232,0.0001627113,0.0016029,0.0000793158,0.0001818484,0.0006270559,0.0006147912,0.6471896,0.00278109,0.3434358,0.002964475,0.0000608245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4740179,0.007134639,0.4661272,0.01804182,0.0006363578,0.0004670814,0.004678404,0.002696822,0.02619981],"genre_scores_gemma":[0.7585545,0.003214094,0.2184447,0.001242769,0.001136095,0.0004476621,0.006423056,0.0009290152,0.009608076],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01481741,"threshold_uncertainty_score":0.04956919,"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."}}