{"id":"W2185072563","doi":"","title":"On the complexity of #nding common approximate substrings","year":2003,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"","keywords":"Parameterized complexity; Substring; Hamming distance; Mathematics; Combinatorics; Alphabet; String (physics); Class (philosophy); Set (abstract data type); Time complexity; Hamming code; Discrete mathematics; Algorithm; 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.004369014,0.001081951,0.001867229,0.00157144,0.001781597,0.007894983,0.003443943,0.003328802,0.01112678],"category_scores_gemma":[0.04427267,0.0009750262,0.002026151,0.003852107,0.003628273,0.01508948,0.003927725,0.003569816,0.001192342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004123784,"about_ca_system_score_gemma":0.002867636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00455415,"about_ca_topic_score_gemma":0.003699856,"domain_scores_codex":[0.9939337,0.00196296,0.0004888469,0.001517106,0.001407578,0.0006896852],"domain_scores_gemma":[0.9190968,0.06958976,0.003720672,0.005505439,0.001262384,0.0008249111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001649489,0.0004946538,0.01124565,0.000977244,0.0002667297,0.000511747,0.001128908,0.6072742,0.006448679,0.206132,0.01225822,0.1516124],"study_design_scores_gemma":[0.0001094431,0.00009166625,0.00138358,0.00004454132,0.00007762657,0.0003006366,0.0003068067,0.7066418,0.003166637,0.2852864,0.002552515,0.00003837623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5062068,0.001851635,0.4576033,0.00785239,0.0001203864,0.0003944604,0.002752676,0.001974213,0.02124414],"genre_scores_gemma":[0.8162519,0.001864196,0.1657414,0.000565203,0.0003625442,0.0004889721,0.004529839,0.0006840548,0.009511827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01112678,"threshold_uncertainty_score":0.0372228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06589192076454257,"score_gpt":0.2635647412571811,"score_spread":0.1976728204926385,"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."}}