{"id":"W1551534812","doi":"10.1007/978-3-642-03784-9_30","title":"Practical Algorithms for the Longest Common Extension Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Substring; Computer science; String (physics); Computation; Algorithm; Constant (computer programming); Extension (predicate logic); Preprocessor; Time complexity; String searching algorithm; Theoretical computer science; Data structure; 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.004145273,0.002576587,0.00281098,0.002977854,0.002598177,0.005376616,0.005971719,0.003208441,0.02827497],"category_scores_gemma":[0.01961007,0.001477766,0.002653717,0.005909262,0.002912033,0.01182419,0.006669905,0.006286496,0.007842009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002618695,"about_ca_system_score_gemma":0.003787162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001956107,"about_ca_topic_score_gemma":0.00287467,"domain_scores_codex":[0.9952468,0.00113807,0.0003748677,0.00121723,0.001422797,0.0006001796],"domain_scores_gemma":[0.9862255,0.008164376,0.000587691,0.003460306,0.001225671,0.0003365344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007085436,0.000465114,0.0006340281,0.0007346043,0.0001186692,0.0001507831,0.0004991897,0.05952926,0.003753493,0.3621463,0.04428423,0.5269758],"study_design_scores_gemma":[0.0003662999,0.0001072174,0.0002068081,0.0001032429,0.00006761659,0.0003329964,0.0002034095,0.1871078,0.002383303,0.7932369,0.01582546,0.00005907666],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008673394,0.001136292,0.9705154,0.00114663,0.0003384663,0.0002531027,0.0004364751,0.001890529,0.01560961],"genre_scores_gemma":[0.0814061,0.001040211,0.9028999,0.000393396,0.000604246,0.0006418747,0.001688418,0.0009015975,0.01042426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02827497,"threshold_uncertainty_score":0.09458911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04154135032237433,"score_gpt":0.3083783851601656,"score_spread":0.2668370348377913,"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."}}