{"id":"W2964110985","doi":"10.4230/lipics.stacs.2014.506","title":"Space-Efficient String Indexing for Wildcard Pattern Matching","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search engine indexing; Log-log plot; Binary logarithm; String (physics); Combinatorics; Alphabet; Mathematics; Pattern matching; Data structure; Matching (statistics); String searching algorithm; Computer science; Statistics; Information retrieval","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"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.001257077,0.0007693597,0.001806458,0.003231807,0.0009666829,0.002652897,0.002687653,0.001204078,0.007394077],"category_scores_gemma":[0.01046532,0.0005469082,0.0007434148,0.008714428,0.00111354,0.008844637,0.00313865,0.001251255,0.003570759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001265616,"about_ca_system_score_gemma":0.001721856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001232862,"about_ca_topic_score_gemma":0.001398616,"domain_scores_codex":[0.9967272,0.0004681241,0.0004578189,0.0004919462,0.001561548,0.0002934],"domain_scores_gemma":[0.9931131,0.002159142,0.0005086067,0.003245843,0.0008124152,0.0001609757],"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.001301447,0.0002880118,0.002382508,0.0006468648,0.00009383488,0.0002961398,0.0004241181,0.01310096,0.03833121,0.06848066,0.02421464,0.8504395],"study_design_scores_gemma":[0.0004489743,0.0008959286,0.002059959,0.0002296461,0.0001738852,0.001767604,0.0005064648,0.431009,0.1587183,0.3147836,0.0892387,0.0001678889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07356841,0.003650893,0.8954761,0.0009657544,0.0003962576,0.0004023496,0.002847724,0.01310183,0.009590651],"genre_scores_gemma":[0.2753137,0.001487531,0.7069597,0.0006074267,0.0003463422,0.0004402317,0.007452244,0.00113412,0.006258756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007394077,"threshold_uncertainty_score":0.02473563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01213838433187622,"score_gpt":0.2447061751236069,"score_spread":0.2325677907917306,"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."}}