{"id":"W2076953942","doi":"10.1142/s0129054112400199","title":"CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Suffix; Time complexity; Extension (predicate logic); Suffix array; Factorization; Suffix tree; Parallel algorithm; Compressed suffix array; Running time; Mathematics; 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.002843002,0.001419713,0.001577919,0.002505212,0.001203141,0.002804393,0.003779808,0.00177782,0.004802874],"category_scores_gemma":[0.01272553,0.0008582167,0.001666214,0.003851518,0.002544609,0.00753779,0.002275602,0.002821339,0.002421715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001577822,"about_ca_system_score_gemma":0.002758902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004776705,"about_ca_topic_score_gemma":0.006581449,"domain_scores_codex":[0.9959734,0.0008593703,0.000389387,0.001109017,0.001308779,0.0003599721],"domain_scores_gemma":[0.9932542,0.002384859,0.0003580024,0.002545432,0.001303154,0.0001542214],"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.0009124025,0.0001141667,0.002651415,0.0003996905,0.0001409293,0.0002339056,0.0005105955,0.0783617,0.01700744,0.2322621,0.01521931,0.6521863],"study_design_scores_gemma":[0.0002051491,0.0004514405,0.001731018,0.0002627651,0.0001217147,0.00109884,0.0002403437,0.6118893,0.05599944,0.2548352,0.0729499,0.0002148702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01613957,0.0007172017,0.9723151,0.0004204635,0.0001396365,0.0001365178,0.0002086366,0.003180539,0.00674234],"genre_scores_gemma":[0.07376803,0.0004591353,0.9179328,0.0002695832,0.0001668902,0.0001782399,0.0004482177,0.000727881,0.006049185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004802874,"threshold_uncertainty_score":0.01606727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01584525680787859,"score_gpt":0.3125886062766008,"score_spread":0.2967433494687223,"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."}}