{"id":"W1976682045","doi":"10.1145/1242471.1242472","title":"A taxonomy of suffix array construction algorithms","year":2014,"lang":"en","type":"review","venue":"Minerva Access (University of Melbourne)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":307,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Suffix array; Suffix; Algorithm; Implementation; Compressed suffix array; Suffix tree; Generalized suffix tree; Data structure; Theoretical computer science; Programming language","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.001666521,0.001439439,0.00142759,0.006690246,0.0008310988,0.002639622,0.002715476,0.001741281,0.004892101],"category_scores_gemma":[0.008266757,0.0008822663,0.001037949,0.01429329,0.0009972426,0.005633964,0.001425033,0.002188513,0.007496295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009309998,"about_ca_system_score_gemma":0.002206843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009388595,"about_ca_topic_score_gemma":0.0008257874,"domain_scores_codex":[0.9983053,0.0002583206,0.0002479324,0.0003716235,0.0007042147,0.0001126912],"domain_scores_gemma":[0.9956452,0.002424947,0.0002491011,0.0004253284,0.001170704,0.00008472216],"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.00004365411,0.00006816702,0.0004570475,0.003545283,0.00003211708,0.00006310386,0.0001126116,0.002118079,0.002094531,0.02679836,0.01705674,0.9476104],"study_design_scores_gemma":[0.00003831621,0.0002084703,0.001031877,0.002489553,0.00008392055,0.002876383,0.0002425435,0.01551652,0.01092396,0.05630221,0.9101684,0.0001179203],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.005827402,0.5717989,0.37517,0.002407015,0.001175399,0.0005568641,0.001269096,0.002738993,0.03905632],"genre_scores_gemma":[0.02054299,0.5449899,0.4151386,0.001524263,0.001078128,0.0007496293,0.004045807,0.0005585673,0.01137218],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006690246,"threshold_uncertainty_score":0.01636577,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07356066266408752,"score_gpt":0.287019720484159,"score_spread":0.2134590578200715,"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."}}