{"id":"W2399734345","doi":"","title":"Improved Two-Way Bit-parallel Search","year":2014,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Sheridan College","funders":"","keywords":"String searching algorithm; Computer science; Sublinear function; String (physics); Algorithm; Bit array; Matching (statistics); Approximate string matching; Bit (key); Pattern matching; Theoretical computer science; Mathematics; Discrete mathematics; 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.0007976225,0.00106212,0.001618776,0.002314007,0.0009219719,0.001658908,0.002887183,0.001155432,0.01129148],"category_scores_gemma":[0.004047522,0.0005897181,0.0009718936,0.004416298,0.0007408416,0.003725228,0.002279192,0.001301418,0.005132981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085821,"about_ca_system_score_gemma":0.002481461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003225834,"about_ca_topic_score_gemma":0.004674462,"domain_scores_codex":[0.9981287,0.0002257492,0.0001772954,0.0003115791,0.001002818,0.0001539121],"domain_scores_gemma":[0.9978392,0.0004771805,0.0001340701,0.0007080831,0.0007571662,0.0000844301],"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.0008408947,0.0002766671,0.0009806419,0.0003430149,0.0001016792,0.000161883,0.0001186634,0.08338434,0.02204495,0.03536168,0.01349262,0.8428929],"study_design_scores_gemma":[0.0002526243,0.0002514156,0.0005220996,0.00003888974,0.00006451525,0.0004895144,0.00005019807,0.9187132,0.02251058,0.03708261,0.01996646,0.00005791256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01731867,0.0008196136,0.9675991,0.0002409386,0.0002240054,0.000169802,0.0003301652,0.005070286,0.008227509],"genre_scores_gemma":[0.1186375,0.0004240056,0.864778,0.0003043213,0.0001069526,0.0003082483,0.001178652,0.0005151262,0.0137472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01129148,"threshold_uncertainty_score":0.03777373,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02664909317515039,"score_gpt":0.2750735642817489,"score_spread":0.2484244711065985,"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."}}