{"id":"W2045095870","doi":"10.1016/j.ejc.2012.07.011","title":"Computing the Longest Previous Factor","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Substring; Suffix array; Combinatorics; Suffix; Factor (programming language); Mathematics; Prefix; Permutation (music); String (physics); Compressed suffix array; Discrete mathematics; Algorithm; Data structure; Suffix tree; Computer science; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.001051455,0.001382981,0.001569832,0.00322858,0.001694472,0.003820418,0.001993001,0.001254339,0.02543271],"category_scores_gemma":[0.008964866,0.0005964061,0.001767698,0.003624839,0.001728536,0.007617835,0.00210506,0.001784036,0.00783012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178113,"about_ca_system_score_gemma":0.002001551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003174137,"about_ca_topic_score_gemma":0.005832078,"domain_scores_codex":[0.9981187,0.0001471538,0.0001627729,0.0006635796,0.0004728334,0.0004348976],"domain_scores_gemma":[0.9951704,0.001656088,0.0003081219,0.001648041,0.0008571155,0.0003602355],"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.003945269,0.0005874704,0.0129074,0.0009661496,0.0003063136,0.0007293992,0.0008162039,0.03705762,0.04721626,0.1205932,0.03924023,0.7356345],"study_design_scores_gemma":[0.0003915564,0.0008230375,0.005293597,0.0002801723,0.0005382453,0.001581245,0.0009486027,0.2831864,0.09332986,0.5588759,0.05451297,0.0002383283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4255181,0.003206909,0.5162168,0.003278692,0.001228855,0.0002593591,0.004286045,0.007496983,0.03850834],"genre_scores_gemma":[0.6440767,0.0009374298,0.3233006,0.0003421423,0.0004665093,0.0001383976,0.006217108,0.001656573,0.02286442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02543271,"threshold_uncertainty_score":0.08508086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02312963989812978,"score_gpt":0.2435922149546209,"score_spread":0.2204625750564911,"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."}}