{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009904244,0.0004227393,0.0004724173,0.0002647586,0.0006489761,0.000867032,0.001614326,0.0001881168,0.000006494549],"category_scores_gemma":[0.00009196045,0.0003699934,0.0002733519,0.0002375255,0.00005299139,0.001559658,0.001033557,0.0003567055,0.00005392991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001175446,"about_ca_system_score_gemma":0.00005515797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003168691,"about_ca_topic_score_gemma":0.000006394292,"domain_scores_codex":[0.9970459,0.0000388739,0.0009544044,0.0004325627,0.0005870978,0.0009411699],"domain_scores_gemma":[0.9976342,0.0002943794,0.0004917057,0.001100706,0.0002222679,0.0002567267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001518073,0.0007599863,0.005089153,0.002197051,0.0003247296,0.000007463928,0.0269819,0.02107318,0.0004276072,0.1282175,0.01006239,0.8047072],"study_design_scores_gemma":[0.002347097,0.0001974462,0.0004447778,0.0003057191,0.0000197704,0.00002478439,0.0004113867,0.9124998,0.0008283866,0.001676347,0.08067442,0.0005700057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06142811,0.00002262042,0.9345914,0.000295889,0.001352435,0.0009889512,0.0002450957,0.0002888756,0.0007866835],"genre_scores_gemma":[0.8439673,0.000009035416,0.1539505,0.001014418,0.0004190718,0.0001646965,0.0003098408,0.00005655907,0.0001086335],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8914267,"threshold_uncertainty_score":0.9998752,"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."}}