{"id":"W2067675443","doi":"10.1007/s11786-010-0033-6","title":"Fast, Practical Algorithms for Computing All the Repeats in a String","year":2010,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Suffix array; Algorithm; Byte; Suffix tree; String searching algorithm; Computer science; Suffix; String (physics); Generalized suffix tree; Pattern matching; Compressed suffix array; Data structure; Mathematics","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.002363771,0.002635651,0.00192745,0.002806956,0.001780674,0.003470712,0.00370916,0.002338184,0.01143194],"category_scores_gemma":[0.0153161,0.001007329,0.001589502,0.004006229,0.001808472,0.007095273,0.003529622,0.004255143,0.006328175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001552368,"about_ca_system_score_gemma":0.003058688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001732995,"about_ca_topic_score_gemma":0.004471669,"domain_scores_codex":[0.9970805,0.0005984919,0.0002730358,0.0006494932,0.001169913,0.0002285644],"domain_scores_gemma":[0.9918384,0.004051533,0.000425464,0.002489537,0.000984629,0.0002104657],"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.0006632417,0.0002023661,0.001123844,0.0005160226,0.0001183112,0.0001066027,0.0003306273,0.03697527,0.01250196,0.07392929,0.0185942,0.8549383],"study_design_scores_gemma":[0.0004675537,0.0003252756,0.0007365121,0.0001096301,0.0001307954,0.0006273654,0.000359307,0.5353876,0.02158877,0.4198369,0.02032316,0.0001071826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006562877,0.0005971788,0.9870207,0.0002570953,0.0001368792,0.000104803,0.0002133543,0.003162017,0.001945119],"genre_scores_gemma":[0.0490067,0.0004567942,0.9458495,0.0001154319,0.0001474072,0.0002688437,0.000755902,0.0003618681,0.00303752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01143194,"threshold_uncertainty_score":0.03824365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05655433533544037,"score_gpt":0.3537429007534002,"score_spread":0.2971885654179598,"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."}}