{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235884,0.0001356286,0.0002062801,0.000117679,0.0005681522,0.0005801985,0.001001133,0.00004957709,0.000001671142],"category_scores_gemma":[0.00005079885,0.0000814407,0.00006082,0.0003240105,0.00005909465,0.0006969646,0.0006579051,0.0006002205,0.000004398568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001646167,"about_ca_system_score_gemma":0.00004426302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001387948,"about_ca_topic_score_gemma":0.00000629291,"domain_scores_codex":[0.9985329,0.0000737056,0.0004366564,0.0002442965,0.000442566,0.0002698962],"domain_scores_gemma":[0.9984129,0.0002121124,0.000303407,0.0005872693,0.000218008,0.0002662703],"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.00001717551,0.0000419343,0.0002230159,0.00002230034,0.00002420875,0.00002275414,0.0002918561,0.00008871555,0.007897594,0.01748713,0.0007635112,0.9731198],"study_design_scores_gemma":[0.002614925,0.001408292,0.02780679,0.001087045,0.0001163472,0.002961294,0.0006132737,0.5906115,0.00755692,0.08079933,0.2829827,0.001441573],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01164425,0.0006502615,0.9844359,0.0023754,0.0002313874,0.0003823789,0.00001014992,0.00003774394,0.0002325699],"genre_scores_gemma":[0.1771743,0.0006488367,0.8206807,0.0002642245,0.001031842,0.00003173162,0.000007337961,0.00003222323,0.0001288015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9716783,"threshold_uncertainty_score":0.5594867,"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."}}