{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003784622,0.000188065,0.0002415936,0.0002588185,0.000281942,0.0007316543,0.002724357,0.00006835783,0.000001943527],"category_scores_gemma":[0.0003134374,0.0001324148,0.00005139864,0.001045984,0.0002641263,0.00102488,0.001884312,0.0005361535,0.000008538096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005759068,"about_ca_system_score_gemma":0.00020336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002186499,"about_ca_topic_score_gemma":0.00003507449,"domain_scores_codex":[0.9974658,0.00004188344,0.0005258573,0.0007118444,0.0006265992,0.0006279958],"domain_scores_gemma":[0.9972551,0.001096915,0.0001904772,0.001222213,0.0001227112,0.0001125699],"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.000006213381,0.0008822526,0.00055944,0.0001130471,0.000009744418,0.000100226,0.01239943,0.007923703,0.002875524,0.4063655,0.0005353888,0.5682296],"study_design_scores_gemma":[0.0003095205,0.00004500513,0.0008140708,0.00007895079,0.000001507265,0.00009665834,0.00003435606,0.9757599,0.0005441338,0.02177871,0.0003606366,0.0001765237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03268209,0.000009440726,0.9644825,0.001112133,0.001063524,0.0004470304,0.000001706966,0.0000791142,0.000122424],"genre_scores_gemma":[0.1610853,0.000001789744,0.8385286,0.0002007264,0.0001494387,0.00001811838,7.640554e-7,0.000008103817,0.000007118542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9678362,"threshold_uncertainty_score":0.705536,"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."}}