{"id":"W2002246332","doi":"10.1016/j.jda.2010.08.004","title":"The longest common extension problem revisited and applications to approximate string searching","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Substring; String (physics); Extension (predicate logic); Computation; Constant (computer programming); Algorithm; String searching algorithm; Approximate string matching; Preprocessor; Mathematics; Computer science; Range (aeronautics); Pattern matching; Data structure; 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.009429348,0.0009828265,0.004001791,0.004516286,0.002503142,0.007049595,0.005287636,0.005562756,0.005595292],"category_scores_gemma":[0.06852252,0.001096863,0.001805304,0.01728913,0.005661457,0.0176616,0.004966496,0.006122372,0.00078921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002249988,"about_ca_system_score_gemma":0.003057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0023311,"about_ca_topic_score_gemma":0.002127227,"domain_scores_codex":[0.9941183,0.002389894,0.0005303835,0.001067913,0.001516132,0.0003773959],"domain_scores_gemma":[0.9505093,0.04005166,0.001985503,0.004362497,0.002311524,0.0007794104],"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.0003236599,0.0002490049,0.00183279,0.0005225487,0.0001187651,0.0004776079,0.0005176383,0.1081161,0.001070433,0.7114119,0.008549554,0.16681],"study_design_scores_gemma":[0.00003625396,0.00006059757,0.0002814999,0.00008633062,0.00004305675,0.0004492705,0.0002494001,0.2356748,0.0006100561,0.7559882,0.00647651,0.00004398761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05669967,0.02084058,0.8994584,0.007355302,0.0009002392,0.0001466107,0.0003944445,0.0002652175,0.01393948],"genre_scores_gemma":[0.5148559,0.02415946,0.441655,0.001095702,0.004233433,0.0003211402,0.0009625641,0.0003654719,0.01235128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009429348,"threshold_uncertainty_score":0.04986775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01415779622695565,"score_gpt":0.29080555133089,"score_spread":0.2766477551039344,"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."}}