{"id":"W4235493345","doi":"10.1007/978-0-387-39940-9_2245","title":"Compressed Suffix Tree","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Computer science; Tree (set theory); Suffix tree; Mathematics; Linguistics; Combinatorics; Philosophy","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.000387714,0.0005935852,0.0009767603,0.000321423,0.0001110985,0.0001211084,0.002472486,0.0003246861,0.00008253537],"category_scores_gemma":[0.00003340757,0.0005256188,0.0002047356,0.00009677967,0.00008472261,0.000816884,0.0009741588,0.0004894491,0.0002647316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005424922,"about_ca_system_score_gemma":0.0002210143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001919457,"about_ca_topic_score_gemma":0.00001618796,"domain_scores_codex":[0.9965082,0.00007011806,0.001013435,0.0009873701,0.001016659,0.0004042202],"domain_scores_gemma":[0.9954085,0.0002016732,0.0008268186,0.003100917,0.0002053918,0.0002567231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002418875,0.000164959,0.00001137412,0.0005953046,0.0001398842,0.0003508603,0.0001834859,0.0000727677,0.0001299142,0.5660435,0.3133534,0.1189304],"study_design_scores_gemma":[0.0004154144,0.0001246394,0.00002597963,0.001142904,0.00004178396,0.00003937663,0.000005653294,0.006778546,0.00002670144,0.001030031,0.9897624,0.00060659],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000003600832,0.006542881,0.1240396,0.00005591255,0.002426515,0.0006499448,0.00165467,0.0002526029,0.8643743],"genre_scores_gemma":[0.0005076304,0.00755491,0.04282928,0.0001400275,0.00253367,0.00004661894,0.004147551,0.0001539668,0.9420863],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6764089,"threshold_uncertainty_score":0.9997196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01623213664273853,"score_gpt":0.2306315574741651,"score_spread":0.2143994208314266,"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."}}