{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499051,0.0005774169,0.0004515211,0.001166135,0.0006804448,0.00120269,0.001085079,0.0007817295,0.005026918],"category_scores_gemma":[0.003520084,0.0003576045,0.0005034395,0.002558621,0.0005230323,0.003165958,0.0009630847,0.001077304,0.003458377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006106723,"about_ca_system_score_gemma":0.0009534282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000669712,"about_ca_topic_score_gemma":0.001521543,"domain_scores_codex":[0.9993212,0.0001033494,0.00006692394,0.0001096288,0.0003481735,0.00005062371],"domain_scores_gemma":[0.9983884,0.0005679535,0.0001272259,0.0005046755,0.000377492,0.00003420667],"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.0001991383,0.00005864423,0.0009522471,0.0002801738,0.00003847688,0.0001057993,0.0001562572,0.02291072,0.04523313,0.05510247,0.01083469,0.8641282],"study_design_scores_gemma":[0.0001551486,0.0004765603,0.001845311,0.0001745909,0.00006675843,0.001258604,0.0002413415,0.5831556,0.1444328,0.1572502,0.1108479,0.00009526185],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01702773,0.001026247,0.9696169,0.0002303434,0.0001137997,0.00008851746,0.0002300266,0.005548415,0.006118033],"genre_scores_gemma":[0.08987077,0.0008750114,0.903688,0.0001649289,0.00009746754,0.0001484789,0.0008225696,0.0002678517,0.004064909],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005026918,"threshold_uncertainty_score":0.01681668,"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."}}