{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794002,0.0002217114,0.0002929926,0.0001410043,0.0003476999,0.0002283187,0.00125161,0.000138139,0.00005302955],"category_scores_gemma":[0.0001056068,0.0002136565,0.00006668492,0.0004163375,0.00009053198,0.0005366241,0.0004626001,0.0003679661,0.00008238099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003493467,"about_ca_system_score_gemma":0.0001252312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002648086,"about_ca_topic_score_gemma":0.000001151762,"domain_scores_codex":[0.99814,0.0001039365,0.0003653852,0.0006983179,0.0002246134,0.0004677112],"domain_scores_gemma":[0.9984085,0.0001163272,0.0001949617,0.000908009,0.0002182121,0.0001540056],"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.000005678921,0.0001294205,0.0003240137,0.00001099874,0.00001831139,0.0001413452,0.0002541911,0.00002651586,0.002207461,0.2330506,0.00213561,0.7616959],"study_design_scores_gemma":[0.002159517,0.0008516613,0.08546436,0.0005271128,0.00004329124,0.0007781968,0.00008781558,0.8243575,0.006971774,0.04654988,0.03055551,0.001653468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005057879,0.0001923259,0.9854662,0.001412494,0.0002633143,0.0001613173,0.00001408338,0.0004398959,0.006992515],"genre_scores_gemma":[0.7168956,0.00006528547,0.2818957,0.0007614533,0.0001721577,0.000004630342,0.00005636079,0.000006784704,0.0001420679],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8243309,"threshold_uncertainty_score":0.8712659,"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."}}