{"id":"W1977410585","doi":"10.1016/j.jda.2006.10.003","title":"Fast pattern-matching on indeterminate strings","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Indeterminate; String (physics); Alphabet; Pattern matching; String searching algorithm; Matching (statistics); Combinatorics; Mathematics; Integer (computer science); Position (finance); Algorithm; Computer science; Discrete mathematics; Artificial intelligence; Pure mathematics; Linguistics","routes":{"ca_aff":true,"ca_fund":true,"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.001049315,0.0005697957,0.001261996,0.001696518,0.0006436463,0.001267542,0.001322734,0.001274269,0.003674809],"category_scores_gemma":[0.009190893,0.00040721,0.0004716882,0.003994023,0.0007166137,0.003652381,0.00216459,0.001055324,0.001256565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000408907,"about_ca_system_score_gemma":0.0006175275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005258284,"about_ca_topic_score_gemma":0.0006320143,"domain_scores_codex":[0.9980718,0.0004398934,0.0001952361,0.0003399526,0.0007791488,0.0001738941],"domain_scores_gemma":[0.9954626,0.002341243,0.0002842426,0.001322259,0.0004872645,0.0001024625],"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.001265356,0.000151883,0.00159084,0.0003077963,0.00005980389,0.0004670441,0.0001636862,0.03658244,0.02878079,0.06171308,0.006607987,0.8623093],"study_design_scores_gemma":[0.0001444668,0.0003085317,0.0008082388,0.00005788196,0.00004367735,0.0008444692,0.0001101666,0.7271944,0.04697344,0.2169512,0.006526851,0.00003659256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1155289,0.0008871911,0.8767895,0.0004546167,0.0002507492,0.0001301765,0.0003235214,0.001876987,0.003758427],"genre_scores_gemma":[0.527582,0.0005392635,0.4631462,0.0002489302,0.0001486687,0.0001611981,0.0007173386,0.0002770362,0.007179369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003674809,"threshold_uncertainty_score":0.01229346,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00796072570902388,"score_gpt":0.2421792449441994,"score_spread":0.2342185192351755,"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."}}