{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008947858,0.0004821281,0.0004881676,0.0007159045,0.0003600869,0.0006618197,0.002627468,0.0002712796,0.00001916729],"category_scores_gemma":[0.00004468539,0.0004200535,0.00007532642,0.0004204533,0.0009557696,0.0008058288,0.002973107,0.0007647756,0.00001860022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001513673,"about_ca_system_score_gemma":0.0002212381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006957588,"about_ca_topic_score_gemma":0.0001978729,"domain_scores_codex":[0.9964405,0.0000221312,0.0004517618,0.001518358,0.0009123547,0.0006548607],"domain_scores_gemma":[0.9976934,0.0003874654,0.000221627,0.001305514,0.0001470417,0.0002449514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004011956,0.00001872692,0.00008319807,0.00001997741,0.000005459427,0.00009373249,0.0002640546,0.001131106,0.0000458644,0.08787189,0.00002169107,0.9104403],"study_design_scores_gemma":[0.0004276138,0.0002090018,0.001929959,0.0005333535,0.000007659384,0.000167393,2.420994e-7,0.6916273,0.0006808602,0.2969448,0.006459644,0.001012149],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002103282,0.0008140361,0.994725,0.0002580297,0.001035806,0.0002294006,0.00001064567,0.00016622,0.002550502],"genre_scores_gemma":[0.06667232,0.0001239677,0.9313022,0.0009756318,0.0006195123,0.000002867661,0.00001218712,0.00003374134,0.0002575193],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9094281,"threshold_uncertainty_score":0.9998251,"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."}}