{"id":"W2153541768","doi":"10.1002/rsa.10103","title":"Random suffix search trees","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Random binary tree; Binary search tree; Self-balancing binary search tree; Independent and identically distributed random variables; Tree (set theory); Optimal binary search tree; B-tree; Suffix; Sequence (biology); Suffix tree; Binary number; Discrete mathematics; Binary tree; K-ary tree; Random variable; Statistics; Tree structure; Arithmetic","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":[],"consensus_categories":[],"category_scores_codex":[0.0005171915,0.0002669899,0.0004099432,0.0001171391,0.0003977704,0.000402238,0.0005497471,0.000105064,0.00008764339],"category_scores_gemma":[0.00007373699,0.0001878477,0.0001069933,0.000270687,0.0001045864,0.0004711951,0.0002224647,0.0002398407,0.000009861188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001468096,"about_ca_system_score_gemma":0.0000587964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007460183,"about_ca_topic_score_gemma":0.000005339326,"domain_scores_codex":[0.9980012,0.0002302305,0.0002905237,0.0005930575,0.0004255309,0.0004594134],"domain_scores_gemma":[0.9987739,0.0002724402,0.00006909407,0.0005796804,0.00007234032,0.0002325891],"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.0004046761,0.0001354688,0.0008014736,0.00006820592,0.0001737202,0.000173883,0.001767109,0.0009085277,0.002152415,0.1949266,0.004856045,0.7936319],"study_design_scores_gemma":[0.09941838,0.0007735637,0.01623989,0.000169912,0.0001150765,0.001414584,0.0005581139,0.4508582,0.02440794,0.1357386,0.2672637,0.003042068],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02390391,0.003850268,0.9678112,0.0002930825,0.0009243204,0.0004370805,0.00002848096,0.0002040939,0.002547595],"genre_scores_gemma":[0.7788144,0.0009380354,0.2187045,0.0003726378,0.0003843004,0.00002911587,0.00002548597,0.00003458848,0.0006969874],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7905898,"threshold_uncertainty_score":0.7660205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01303432514685036,"score_gpt":0.2517538110391782,"score_spread":0.2387194858923279,"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."}}