{"id":"W2176225957","doi":"10.1007/978-3-319-07566-2_25","title":"On Hardness of Several String Indexing Problems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Substring; String (physics); Combinatorics; Search engine indexing; Upper and lower bounds; Pattern matching; Linear space; Connection (principal bundle); Space (punctuation); Integer (computer science); String searching algorithm; Simple (philosophy); Mathematics; Discrete mathematics; Data structure; Computer science; Information retrieval; Artificial intelligence","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.004408947,0.002345829,0.004143671,0.00349837,0.004807388,0.00933856,0.006071367,0.005499175,0.02594799],"category_scores_gemma":[0.02453271,0.001936461,0.004738554,0.008493785,0.008724072,0.02787543,0.006839935,0.01946822,0.003457867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005610765,"about_ca_system_score_gemma":0.002660068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001855976,"about_ca_topic_score_gemma":0.001530838,"domain_scores_codex":[0.9936998,0.001569445,0.0003938889,0.001280896,0.002253004,0.0008030608],"domain_scores_gemma":[0.9608692,0.03362519,0.000911608,0.002852283,0.0009764819,0.000765218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004669034,0.0002920839,0.0005398903,0.001030167,0.0001041533,0.0001980044,0.0004915475,0.01371985,0.001151199,0.8630695,0.05254446,0.06639216],"study_design_scores_gemma":[0.00005797459,0.00002066974,0.0001652794,0.00006046149,0.00002908775,0.0001019271,0.00006139347,0.01010619,0.0003285621,0.9840561,0.004992763,0.00001958861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1151832,0.02361926,0.4145728,0.06864855,0.003359857,0.0005006728,0.005394477,0.002376143,0.3663451],"genre_scores_gemma":[0.6573924,0.02185916,0.1840762,0.009480539,0.01229873,0.001319586,0.01100123,0.002714275,0.09985785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02594799,"threshold_uncertainty_score":0.08680469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01680298114204639,"score_gpt":0.2348335628054355,"score_spread":0.2180305816633892,"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."}}