{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00248143,0.001239062,0.001349457,0.004019942,0.00201324,0.002268849,0.002754781,0.001987841,0.01726282],"category_scores_gemma":[0.01045133,0.000727706,0.001559019,0.003803282,0.001480154,0.005441731,0.003734132,0.001880109,0.007518341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009527779,"about_ca_system_score_gemma":0.002183263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009526881,"about_ca_topic_score_gemma":0.0008890438,"domain_scores_codex":[0.9970334,0.0006386171,0.0003858587,0.0006776047,0.0009629143,0.0003016496],"domain_scores_gemma":[0.9962218,0.001507191,0.0002037893,0.001031494,0.0008872353,0.0001484377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007187478,0.0002701893,0.001047823,0.0005386454,0.0001642721,0.0003381514,0.0004098408,0.02622996,0.01352391,0.1955137,0.02954041,0.7317044],"study_design_scores_gemma":[0.0002708217,0.0003658861,0.0006701936,0.0001982621,0.0001568451,0.001510754,0.0003078693,0.2701341,0.04294716,0.5663759,0.1169104,0.0001519538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003601948,0.0002382772,0.9870013,0.000180539,0.0001221137,0.0001908016,0.0003361279,0.001971448,0.006357431],"genre_scores_gemma":[0.04148974,0.0002212513,0.9517536,0.0001562659,0.000078672,0.0003626084,0.001074938,0.00041883,0.004444121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01726282,"threshold_uncertainty_score":0.05774987,"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."}}