{"id":"W1541952385","doi":"10.1007/3-540-45123-4","title":"Combinatorial Pattern Matching: 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings","year":2000,"lang":"en","type":"book","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Substring; String searching algorithm; Suffix tree; Edit distance; Time complexity; Computer science; String (physics); Suffix; Combinatorics; Pattern matching; Upper and lower bounds; Compressed suffix array; Algorithm; Approximation algorithm; Trie; Mathematics; Data structure; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002685129,0.001000219,0.0009986546,0.0002541538,0.0004418573,0.000697331,0.003156115,0.0006285089,0.0004345684],"category_scores_gemma":[0.000007486948,0.0008793891,0.0001983024,0.0002589158,0.00008359281,0.001288717,0.001206724,0.001026771,0.0002778689],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237777,"about_ca_system_score_gemma":0.006548007,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.431437,"about_ca_topic_score_gemma":0.09570064,"domain_scores_codex":[0.9945482,0.00004003963,0.0008916077,0.001671961,0.001769835,0.001078338],"domain_scores_gemma":[0.9972594,0.0001027489,0.0004718096,0.001183369,0.0003614693,0.0006212404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001928821,0.0001066057,0.000008963891,0.00007650092,0.00006270325,0.0001622091,0.0005412808,0.00001965385,0.000004572658,0.004620301,0.982339,0.01203893],"study_design_scores_gemma":[0.001051983,0.0001492057,0.00009859675,0.0003638733,0.00005113804,0.00009443624,0.00002922526,0.004350655,0.00003012491,0.008432747,0.9840549,0.001293113],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001444602,0.001288389,0.01745824,0.002660488,0.01273696,0.001497712,0.002118129,0.00106474,0.9610309],"genre_scores_gemma":[0.0004435645,0.0003136803,0.001563681,0.001216835,0.002467526,0.00004238794,0.0007470363,0.0001302701,0.993075],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3357364,"threshold_uncertainty_score":0.9993657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005044390872451964,"score_gpt":0.1948895557096567,"score_spread":0.1898451648372048,"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."}}