{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003392771,0.0007137369,0.0007851349,0.001794708,0.000773109,0.001709349,0.001521128,0.0009556395,0.0543515],"category_scores_gemma":[0.00240346,0.0004154184,0.0004742425,0.003735005,0.0005006968,0.002838131,0.001602615,0.001239794,0.03573471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000554933,"about_ca_system_score_gemma":0.00128159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009232782,"about_ca_topic_score_gemma":0.001388864,"domain_scores_codex":[0.9994645,0.000051262,0.00004449691,0.00009816071,0.0003001759,0.00004154983],"domain_scores_gemma":[0.9990475,0.0001873033,0.00003280528,0.0003093082,0.0003834651,0.00003971336],"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.000184975,0.00008743276,0.000177549,0.0004029997,0.00002883661,0.0002579778,0.0001076291,0.004165147,0.01694648,0.04611164,0.151411,0.7801182],"study_design_scores_gemma":[0.00007663962,0.0001450057,0.0005017033,0.0002642997,0.0000698002,0.00233548,0.0001257379,0.04712285,0.04107283,0.1215442,0.7866718,0.00006971605],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01497794,0.009672249,0.694793,0.002558368,0.003171524,0.0005736421,0.01644808,0.02576841,0.2320369],"genre_scores_gemma":[0.09088906,0.007696117,0.6031033,0.001619856,0.001080565,0.0004768953,0.0529906,0.004283864,0.2378597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0543515,"threshold_uncertainty_score":0.1818239,"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."}}