{"id":"W2050304496","doi":"10.1016/s1570-8667(03)00037-6","title":"Two-pattern strings I—A recognition algorithm","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Generalization; Class (philosophy); Computer science; String searching algorithm; Algorithm; Pattern matching; Mathematics; Combinatorics; Pattern recognition (psychology); Discrete mathematics; Artificial intelligence; Data structure","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.0009890546,0.0001853557,0.00029165,0.0002065407,0.00009948444,0.0002203222,0.0007133694,0.00006178779,0.00006363472],"category_scores_gemma":[0.00007680534,0.0001498071,0.0002145533,0.000341146,0.00004245189,0.001158222,0.00007718161,0.0003185424,0.00004888415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005721191,"about_ca_system_score_gemma":0.00008929708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001453188,"about_ca_topic_score_gemma":8.054238e-7,"domain_scores_codex":[0.9982071,0.0001656467,0.0005635534,0.0002282674,0.0005064476,0.0003289734],"domain_scores_gemma":[0.9986531,0.0001146263,0.0004949454,0.0003189119,0.0002216199,0.0001967935],"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.000002951822,0.00007098546,0.00008233024,0.00000735278,0.00006333524,0.0001829776,0.0002849147,0.00001959448,0.0005066477,0.001723334,0.0008672288,0.9961883],"study_design_scores_gemma":[0.01768884,0.004174317,0.004897258,0.001382014,0.000411225,0.01597896,0.002920694,0.4178474,0.1469699,0.3298387,0.05391895,0.003971734],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009614921,0.0005800009,0.9861228,0.000292591,0.001175946,0.00007482169,0.00001047402,0.00007548642,0.002052974],"genre_scores_gemma":[0.335132,0.0002128749,0.6629183,0.0008136001,0.0007140455,0.000004777331,0.000005158068,0.00003781722,0.0001614206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9922166,"threshold_uncertainty_score":0.6108958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01531720045314639,"score_gpt":0.2522856864990134,"score_spread":0.236968486045867,"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."}}