{"id":"W4386870944","doi":"10.1007/978-3-031-43980-3_2","title":"On Suffix Tree Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalized suffix tree; Suffix tree; Compressed suffix array; Suffix; String (physics); Time complexity; K-ary tree; Combinatorics; Tree (set theory); Data structure; Computer science; Mathematics; Binary tree; Algorithm; Discrete mathematics; Tree 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.001074783,0.001451201,0.001946312,0.003312545,0.001337406,0.002684557,0.00259901,0.001877987,0.01840813],"category_scores_gemma":[0.006360869,0.0008850021,0.001035129,0.005167562,0.0009930922,0.004520016,0.003296396,0.001538548,0.01231616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006640858,"about_ca_system_score_gemma":0.001162079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155871,"about_ca_topic_score_gemma":0.003013922,"domain_scores_codex":[0.9980975,0.0002913755,0.0001421066,0.0004457082,0.0008874142,0.0001360374],"domain_scores_gemma":[0.9967843,0.001297506,0.00009889535,0.0009993117,0.0007295415,0.00009044733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001887469,0.00008270368,0.0005182233,0.000164467,0.00005090752,0.0001217608,0.00006376228,0.006468744,0.01386523,0.02058422,0.02348341,0.9344078],"study_design_scores_gemma":[0.00006193137,0.0002661686,0.001955384,0.0001789851,0.0001487907,0.002460477,0.0001953498,0.5888646,0.05483507,0.2283038,0.1226184,0.0001110924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008092179,0.002976289,0.9660045,0.0006001797,0.0007560896,0.0001412472,0.0006240029,0.0059657,0.01483979],"genre_scores_gemma":[0.07496987,0.002963148,0.8769959,0.0007126794,0.0009468845,0.0002127569,0.003940787,0.001021878,0.03823615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01840813,"threshold_uncertainty_score":0.06158137,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01869702296680731,"score_gpt":0.2432011069347619,"score_spread":0.2245040839679546,"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."}}