{"id":"W2293388829","doi":"","title":"Crochemore's Repetitions Algorithm Revisited - Computing Runs.","year":2009,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Suffix array; Time complexity; Suffix; Extension (predicate logic); Compressed suffix array; Factorization; Parallel algorithm; Suffix tree; Data structure","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.002430516,0.00151844,0.001264093,0.002225184,0.001203497,0.002754031,0.003180528,0.001641685,0.00670532],"category_scores_gemma":[0.01239205,0.0008110123,0.001751123,0.003372706,0.002378721,0.007540911,0.002410367,0.002845912,0.003573654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416724,"about_ca_system_score_gemma":0.002343496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003601123,"about_ca_topic_score_gemma":0.005362258,"domain_scores_codex":[0.9954765,0.0009104846,0.0003804468,0.001206579,0.001641914,0.0003839787],"domain_scores_gemma":[0.9946185,0.001815425,0.0002981365,0.002025985,0.001115255,0.0001267244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009911947,0.0001201468,0.002658425,0.0005362845,0.0001755221,0.0002598895,0.0005433511,0.04230262,0.01945472,0.2401708,0.0219655,0.6708215],"study_design_scores_gemma":[0.0002692649,0.0007094351,0.002645252,0.0003633099,0.0002066823,0.002395471,0.0003405997,0.4151206,0.09507167,0.3135394,0.1690381,0.0003001934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01414828,0.0009569721,0.9668861,0.0004906652,0.0002996649,0.0002145699,0.0002996206,0.004001468,0.01270278],"genre_scores_gemma":[0.08086152,0.0005795998,0.9026989,0.000462241,0.0002806429,0.0002799169,0.0007105518,0.0009947666,0.01313191],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00670532,"threshold_uncertainty_score":0.02243149,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01707766616431033,"score_gpt":0.2677945298609171,"score_spread":0.2507168636966068,"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."}}