{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004894932,0.0001956223,0.0002502255,0.0001162263,0.0002081346,0.0001827454,0.00165278,0.0001128366,0.00005745363],"category_scores_gemma":[0.0001086154,0.0001710603,0.00004854151,0.0002226748,0.0001337023,0.0004736647,0.001078611,0.0003639954,0.00016157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002311543,"about_ca_system_score_gemma":0.0001306595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002560447,"about_ca_topic_score_gemma":0.00003010854,"domain_scores_codex":[0.9981443,0.0002068869,0.0002557048,0.0006594326,0.00020733,0.0005263531],"domain_scores_gemma":[0.998376,0.0002045675,0.0000982514,0.0009826416,0.0001655791,0.0001729487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003216377,0.0001204074,0.003019873,0.00002911571,0.00003416439,0.00002751974,0.0004372909,0.0002876216,0.01572798,0.6543509,0.00076649,0.3251664],"study_design_scores_gemma":[0.001452191,0.0003448003,0.01232952,0.00003264777,0.000007099737,0.00005985661,0.0000202475,0.9648409,0.00471157,0.007191263,0.008548785,0.0004610993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0390943,0.00004627512,0.9529138,0.0007616746,0.0004546648,0.0001581603,0.000004509839,0.0002323432,0.006334334],"genre_scores_gemma":[0.9283683,0.00001660733,0.07086238,0.0002457069,0.0001354053,0.00002249337,0.00001147458,0.000008793922,0.0003288287],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9645533,"threshold_uncertainty_score":0.6975636,"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."}}