{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480336,0.0001195963,0.0001557861,0.0000600346,0.0002008013,0.0001805009,0.001619457,0.00001424604,0.000007218192],"category_scores_gemma":[0.00009923569,0.00007101669,0.00008912184,0.0002527232,0.00003110099,0.0007532074,0.000531849,0.0003625115,0.0000587874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003243871,"about_ca_system_score_gemma":0.00003203337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.966239e-7,"about_ca_topic_score_gemma":1.75401e-8,"domain_scores_codex":[0.9983382,0.0004904412,0.0003911321,0.00009239191,0.0004167731,0.0002710171],"domain_scores_gemma":[0.9985727,0.0001698893,0.000460813,0.0004364485,0.0001770168,0.000183125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002709606,0.001289849,0.03047445,0.00005977129,0.0001803366,0.0006158153,0.01132284,0.0002534732,0.0005033663,0.2415817,0.05730138,0.65639],"study_design_scores_gemma":[0.002306389,0.001097268,0.3385589,0.0003168186,0.00005746037,0.002176942,0.0001979733,0.009522621,0.0009141433,0.003046571,0.64101,0.0007948343],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09427853,0.004133607,0.8904746,0.000667387,0.005265907,0.00008787493,0.000001483918,0.00005814967,0.005032435],"genre_scores_gemma":[0.9940373,0.00007387412,0.00512292,0.0001635651,0.0005217144,6.518887e-8,3.098535e-7,0.00001348664,0.00006670875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8997588,"threshold_uncertainty_score":0.300938,"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."}}