{"id":"W2048952423","doi":"10.1145/1739041.1739075","title":"Suffix tree construction algorithms on modern hardware","year":2010,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Cache algorithms; Parallel computing; Generalized suffix tree; Compressed suffix array; Suffix tree; Exploit; Algorithm; String (physics); Suffix array; Search engine indexing; Suffix; CPU cache; Data structure; Operating system; Artificial intelligence; 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.0001221534,0.0001260187,0.0001088983,0.00007654432,0.0001696533,0.0001773687,0.0006629828,0.00008359259,0.0001193066],"category_scores_gemma":[0.00001833396,0.00009578179,0.00004649493,0.0001434697,0.00004751042,0.0005710674,0.00027353,0.000256515,0.0001924718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000104966,"about_ca_system_score_gemma":0.00003679416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004427899,"about_ca_topic_score_gemma":0.00002697291,"domain_scores_codex":[0.9989262,0.00001810907,0.0001414956,0.0003986231,0.0002772752,0.0002382541],"domain_scores_gemma":[0.9989697,0.00004212379,0.00004786575,0.0007614607,0.00006467059,0.00011418],"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.000003275092,0.00005242229,0.0001052757,0.000001867076,0.000004411915,0.000008056596,0.00006930709,0.00002108176,0.002739108,0.1001597,0.003913326,0.8929222],"study_design_scores_gemma":[0.0005480122,0.000132645,0.002307118,0.00001399938,0.00000348616,0.0000879163,0.00002121769,0.9245105,0.01207482,0.01883498,0.04113075,0.0003345725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007820779,0.00001051102,0.9707067,0.0005510045,0.001682115,0.00008999529,0.000008309155,0.0003430611,0.01878751],"genre_scores_gemma":[0.1904155,0.000009284868,0.806837,0.000551664,0.0004130348,0.00001364848,0.00002097069,0.00001436061,0.001724596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9244894,"threshold_uncertainty_score":0.3905868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01232356267364128,"score_gpt":0.2385902969930136,"score_spread":0.2262667343193723,"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."}}