{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003072143,0.00006903695,0.00009726759,0.00002827219,0.0001254805,0.00005233486,0.0006135774,0.00001934237,0.00006683445],"category_scores_gemma":[0.00002704554,0.0000387877,0.00003133756,0.0001758036,0.0000868771,0.0001562299,0.0001640274,0.00008152681,0.00001741598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000933888,"about_ca_system_score_gemma":0.00001004507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004745847,"about_ca_topic_score_gemma":0.00000303079,"domain_scores_codex":[0.9993322,0.0000629093,0.0001318136,0.00015554,0.0001843144,0.0001332211],"domain_scores_gemma":[0.9991938,0.0001362667,0.00006425811,0.0005517124,0.00002232293,0.00003164895],"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.000001058386,0.00002910791,0.000120925,0.000002763958,0.000002134799,6.775855e-7,0.00005302613,0.00001624967,0.0002825134,0.9972357,0.001011414,0.001244448],"study_design_scores_gemma":[0.0005260395,0.0001551222,0.004965642,0.00008085059,0.000004549071,0.00001804834,0.0001323873,0.2972369,0.1104691,0.5797858,0.006295979,0.0003295729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08495747,0.00002330254,0.8686777,0.0005738171,0.0001939427,0.0001359757,0.000003354231,0.00008965842,0.04534482],"genre_scores_gemma":[0.967197,0.000002327922,0.03250711,0.0002008112,0.000006091534,0.000002493497,0.000001134816,0.000002722644,0.00008027545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8822396,"threshold_uncertainty_score":0.1581717,"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."}}