{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006644186,0.0004883254,0.0004094543,0.001021619,0.0003378798,0.0005637167,0.00325166,0.0003286305,0.00001512229],"category_scores_gemma":[0.0001083959,0.0004177491,0.0001274548,0.000789875,0.0003100823,0.0005877229,0.001737214,0.0008794617,0.0003930739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002443542,"about_ca_system_score_gemma":0.0002424656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003029538,"about_ca_topic_score_gemma":0.0001374654,"domain_scores_codex":[0.996067,0.0000296161,0.0004065617,0.001698115,0.001188488,0.0006102308],"domain_scores_gemma":[0.9970787,0.0006103521,0.0002171401,0.001775781,0.0001437735,0.0001743256],"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.000005213214,0.0000174545,0.000001778342,0.00001144446,0.000004517075,0.00009038752,0.0001226462,0.008986942,0.000119288,0.02047744,0.00007353088,0.9700894],"study_design_scores_gemma":[0.0002293403,0.0003346262,0.0001356318,0.0003564598,0.000004021396,0.00003557958,5.264959e-8,0.6907585,0.001931246,0.3035471,0.002074259,0.0005931182],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003607999,0.00008970743,0.9908431,0.0003199539,0.003964966,0.000260803,0.000007927501,0.0004548081,0.004022685],"genre_scores_gemma":[0.2182914,0.0003489551,0.7610517,0.006022486,0.004210267,0.00007352149,0.00006426738,0.0003323078,0.00960509],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9694963,"threshold_uncertainty_score":0.9998274,"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."}}