{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425768,0.0002145164,0.000311194,0.0002353647,0.0001525706,0.0003305576,0.001187225,0.00007620685,0.00001625347],"category_scores_gemma":[0.00001398784,0.0001565897,0.0001800255,0.0002259273,0.00003329165,0.001256365,0.0003035369,0.0004342528,0.00002384641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006337064,"about_ca_system_score_gemma":0.00005525243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001052474,"about_ca_topic_score_gemma":0.000003117792,"domain_scores_codex":[0.997981,0.0000715776,0.0006130886,0.0002661925,0.0007333579,0.0003347931],"domain_scores_gemma":[0.9985998,0.00009788775,0.0005924514,0.0004313198,0.0001369691,0.0001415979],"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.0000263994,0.0002473514,0.0006938689,0.00002526388,0.0000510724,0.0008484946,0.0004702489,0.002460009,0.001711692,0.002331194,0.00473163,0.9864028],"study_design_scores_gemma":[0.01163781,0.006871285,0.1404241,0.0034166,0.0001920445,0.004347998,0.0007101905,0.6259419,0.04375725,0.09808785,0.06057969,0.004033253],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0513492,0.0001734811,0.9458547,0.0005699067,0.0008953479,0.00007265118,0.00001838411,0.00004436772,0.00102193],"genre_scores_gemma":[0.9149173,0.00004239256,0.08332622,0.0003134874,0.001115832,0.000002278279,0.00000712798,0.00002614894,0.0002491724],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9823695,"threshold_uncertainty_score":0.6385543,"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."}}