{"id":"W4298392132","doi":"10.1007/978-3-031-01885-5_2","title":"External Construction of Suffix Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on data management","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Generalized suffix tree; Suffix; Computer science; Suffix tree; Section (typography); Scalability; Compressed suffix array; Auxiliary memory; Algorithm; Theoretical computer science; Brute force; Data structure; Programming language; Database","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000348119,0.0003952152,0.000428457,0.0003404884,0.0001043499,0.0001379264,0.003717185,0.0001695075,0.0004849857],"category_scores_gemma":[0.00002652999,0.0003242674,0.0001058322,0.00004967083,0.0001070756,0.0005588142,0.002964535,0.0002376826,0.0001398337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005330797,"about_ca_system_score_gemma":0.00002288144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002098954,"about_ca_topic_score_gemma":0.000008954577,"domain_scores_codex":[0.9976171,0.00004380377,0.0004245669,0.0008815239,0.0007427161,0.0002903313],"domain_scores_gemma":[0.9952211,0.0001790386,0.0004258452,0.004039692,0.00003812748,0.00009617279],"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.00001547895,0.00003719349,0.000002352442,0.00007110956,0.0001373043,0.00001634998,0.00001141183,0.0000120526,0.00001352138,0.3396763,0.009312525,0.6506944],"study_design_scores_gemma":[0.0002236684,0.00008797234,0.0004182174,0.00117632,0.0002861499,0.00002557883,0.000006903413,0.001924066,0.001147498,0.02942805,0.9645364,0.0007392174],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009467236,0.003398483,0.5977966,0.0003225484,0.001503671,0.000648045,0.001062531,0.0002209906,0.3950377],"genre_scores_gemma":[0.0153138,0.01302504,0.8483811,0.0009535648,0.002321035,0.0001088549,0.001680059,0.0002925893,0.117924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9552239,"threshold_uncertainty_score":0.999921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03614112577618683,"score_gpt":0.2493223178088231,"score_spread":0.2131811920326362,"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."}}