{"id":"W1599214081","doi":"10.1145/1242471.1242472","title":"A taxonomy of suffix array construction algorithms","year":2007,"lang":"en","type":"article","venue":"ACM Computing Surveys","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Suffix array; Compressed suffix array; Computer science; Suffix; Generalized suffix tree; Suffix tree; Algorithm; Implementation; Theoretical computer science; Data structure; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004021169,0.0001727843,0.0002676455,0.000167255,0.0001702775,0.00007842396,0.001408638,0.00008592534,0.00001066048],"category_scores_gemma":[0.0002464475,0.0001623386,0.00007941925,0.0005829494,0.0001076209,0.0003620288,0.000716699,0.0001894758,0.00002236618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003499598,"about_ca_system_score_gemma":0.00006855407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002628325,"about_ca_topic_score_gemma":0.00001349556,"domain_scores_codex":[0.9980379,0.0002783216,0.0004953546,0.0004518173,0.0003412849,0.0003953087],"domain_scores_gemma":[0.9975129,0.0007281934,0.000304837,0.001134522,0.000203587,0.0001159594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000039277,0.00008947319,0.02305914,0.00001872149,0.00002632556,0.00001397117,0.0002174686,0.000135243,0.001874926,0.004159214,0.0005009336,0.9699007],"study_design_scores_gemma":[0.003073748,0.0006208621,0.6802517,0.0004185412,0.00003173697,0.000422055,0.0004237109,0.1843047,0.08915428,0.0091842,0.0301852,0.001929285],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04772731,0.00007661079,0.9496161,0.00005747508,0.001123409,0.0001524953,0.000006034176,0.0001856788,0.001054929],"genre_scores_gemma":[0.4551077,0.000002750817,0.5446777,0.00003221088,0.0001427815,0.000001048165,0.00001060238,0.000007076297,0.00001808024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9679714,"threshold_uncertainty_score":0.6619974,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03606046574601381,"score_gpt":0.2725099742731359,"score_spread":0.2364495085271221,"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."}}