{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245629,0.001702395,0.001804106,0.002510986,0.000815732,0.003353308,0.002678618,0.001107879,0.07474854],"category_scores_gemma":[0.002557182,0.000942642,0.0006659565,0.006213959,0.001093754,0.003731194,0.001661282,0.001640515,0.03960189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002886019,"about_ca_system_score_gemma":0.003807852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01999397,"about_ca_topic_score_gemma":0.05502734,"domain_scores_codex":[0.9994361,0.00007790788,0.00003136287,0.0001147103,0.0002713781,0.00006849672],"domain_scores_gemma":[0.9987539,0.0003107534,0.00003864256,0.0002391874,0.0004650919,0.0001924089],"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.00009465295,0.00007491536,0.0002869534,0.000445045,0.00004398137,0.00007720061,0.00004414938,0.002051593,0.001792477,0.009627381,0.7134119,0.2720497],"study_design_scores_gemma":[0.00005391118,0.00008593122,0.001433431,0.0003626062,0.00008240975,0.0007570115,0.0001066819,0.01905302,0.003080943,0.0299512,0.9449904,0.00004254707],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.008850009,0.1828103,0.4645316,0.01044867,0.01953765,0.0005329775,0.007845675,0.0140104,0.2914328],"genre_scores_gemma":[0.03503466,0.1336912,0.1726132,0.001675821,0.004679034,0.0004614294,0.0173157,0.003096885,0.6314321],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.07474854,"threshold_uncertainty_score":0.2500588,"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."}}