{"id":"W2371180955","doi":"","title":"Algorithm for Maximal Matching of Strings","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"CAE (Canada)","funders":"","keywords":"String searching algorithm; Computer science; String metric; Matching (statistics); Similarity (geometry); Approximate string matching; Pattern matching; Algorithm; String (physics); Commentz-Walter algorithm; Blossom algorithm; Pattern recognition (psychology); Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Image (mathematics)","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.0001640314,0.0000406659,0.00005974861,0.0000277419,0.00004597337,0.00004052876,0.00014472,0.00001985467,0.000005133576],"category_scores_gemma":[0.00000925405,0.00003578187,0.00002238499,0.0001391307,0.000007969616,0.0001959458,0.00001701582,0.00002132275,0.00000137757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005606505,"about_ca_system_score_gemma":0.00002615045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003104815,"about_ca_topic_score_gemma":3.300054e-7,"domain_scores_codex":[0.9996122,0.000009447414,0.00009493052,0.0001129109,0.00006824535,0.0001022685],"domain_scores_gemma":[0.9997438,0.00003130041,0.00004310144,0.0001058132,0.00005472662,0.00002126592],"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.00000116658,0.00003943738,0.00006615165,0.00002221068,0.000007421364,4.836574e-7,0.0003137995,0.004229276,0.0001712516,0.2226319,0.0003557864,0.7721611],"study_design_scores_gemma":[0.0004046678,0.00006503351,0.00002834048,0.00002143048,0.000004021723,0.000007455582,0.00004097248,0.9129784,0.02789276,0.0562838,0.002135352,0.0001377747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007166562,0.00002957345,0.9948745,0.00004105491,0.0001021156,0.00004881914,3.148753e-7,0.00005460663,0.004132313],"genre_scores_gemma":[0.05226465,0.000002866399,0.9470378,0.00005791139,0.00001394913,0.000003332377,6.040809e-7,0.00000316327,0.0006156786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9087491,"threshold_uncertainty_score":0.1459142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01216889879085188,"score_gpt":0.2375573386368082,"score_spread":0.2253884398459563,"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."}}