{"id":"W4400571454","doi":"10.1016/j.tcs.2024.114728","title":"On suffix tree detection","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Generalized suffix tree; Suffix tree; Compressed suffix array; Suffix; String (physics); Time complexity; Mathematics; K-ary tree; Combinatorics; Tree (set theory); Data structure; Algorithm; Discrete mathematics; Binary tree; Tree structure; Computer science","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.002034922,0.001231021,0.002008713,0.004078903,0.001682282,0.002942049,0.002355755,0.002474985,0.007992485],"category_scores_gemma":[0.01588193,0.0008907677,0.0008859535,0.00611993,0.001701922,0.006289467,0.003842339,0.002107035,0.004315663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009340967,"about_ca_system_score_gemma":0.001564818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002115424,"about_ca_topic_score_gemma":0.002473303,"domain_scores_codex":[0.9963337,0.0008481463,0.0002689823,0.0007197126,0.001571002,0.0002583755],"domain_scores_gemma":[0.989555,0.005677189,0.0003249137,0.00245139,0.001762891,0.0002287617],"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.0005864871,0.0001548781,0.001909894,0.0002334544,0.0001028076,0.0002374465,0.0001803277,0.02149893,0.01561298,0.06492753,0.0204623,0.8740929],"study_design_scores_gemma":[0.00006130202,0.0002071494,0.001501759,0.0001145098,0.0001067631,0.001216077,0.0001561245,0.6733366,0.02420512,0.2642167,0.03480858,0.00006929537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02463605,0.003513786,0.9547772,0.001663741,0.0008334602,0.0001225378,0.000437946,0.002628115,0.01138716],"genre_scores_gemma":[0.2446328,0.003722361,0.718825,0.001382364,0.001966061,0.000245905,0.002727537,0.000796398,0.0257016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007992485,"threshold_uncertainty_score":0.02673751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007287958903204772,"score_gpt":0.2471090558013316,"score_spread":0.2398210968981268,"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."}}