{"id":"W2013662449","doi":"10.1007/3-540-47555-9_12","title":"Suffix trees and string complexity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Suffix tree; Suffix; String (physics); Mathematics; Combinatorics; Generalized suffix tree; Tree (set theory); Discrete mathematics; Shift register; Order (exchange); Computer science; Data structure","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.0005189494,0.0006918072,0.001075648,0.001745041,0.0009613311,0.00325771,0.0009901914,0.001143723,0.01514373],"category_scores_gemma":[0.003517659,0.000523262,0.0006748472,0.004682922,0.002455164,0.00932197,0.001669763,0.003792787,0.004362548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001627574,"about_ca_system_score_gemma":0.0006711013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004860381,"about_ca_topic_score_gemma":0.0005032679,"domain_scores_codex":[0.9992082,0.0001349124,0.00004778513,0.0001266248,0.0004250468,0.00005751972],"domain_scores_gemma":[0.9983262,0.00114653,0.00007809921,0.0002398965,0.0001546327,0.00005468904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001837218,0.00002041372,0.0001324824,0.0001552845,0.00001103612,0.00003960225,0.0001106203,0.003527646,0.0005661905,0.9174782,0.01354452,0.06439559],"study_design_scores_gemma":[0.000002758529,0.000005194334,0.00008777669,0.00001813348,0.000003862687,0.00007222367,0.00001672696,0.002951999,0.0002831924,0.975728,0.02082465,0.000005470975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.03531977,0.04553494,0.4140474,0.01108824,0.002065801,0.00009983956,0.001150276,0.001215011,0.4894788],"genre_scores_gemma":[0.5501611,0.04934509,0.1588439,0.002435799,0.008342923,0.0003816115,0.003122122,0.00106701,0.2263004],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01514373,"threshold_uncertainty_score":0.05066079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0454359545678276,"score_gpt":0.2775626855356532,"score_spread":0.2321267309678256,"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."}}