{"id":"W73714569","doi":"10.1007/978-3-0348-8211-8_16","title":"A Note on Random Suffix Search Trees","year":2002,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Suffix tree; Mathematics; Independent and identically distributed random variables; Random binary tree; Self-balancing binary search tree; Tree (set theory); Binary search tree; Suffix; Optimal binary search tree; Sequence (biology); Binary tree; Binary number; Binary logarithm; Search tree; Discrete mathematics; K-ary tree; Random variable; Search algorithm; Algorithm; Tree structure; Arithmetic; Statistics; Chemistry","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","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004066186,0.0006974725,0.0006814601,0.0004484753,0.0003030789,0.0003652812,0.001999779,0.0004870476,0.0004812999],"category_scores_gemma":[0.00002182845,0.0005795895,0.0003553301,0.00003948522,0.000135674,0.0002038283,0.0009144095,0.0008756183,0.002011869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053992,"about_ca_system_score_gemma":0.0001633216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005679782,"about_ca_topic_score_gemma":0.00002148918,"domain_scores_codex":[0.9964246,0.00008194445,0.0005331559,0.001243189,0.001113126,0.0006039509],"domain_scores_gemma":[0.9966449,0.0003827454,0.0002093603,0.002285654,0.0001490578,0.0003282903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002055316,0.0001256999,0.000003657638,0.00008336231,0.0001294176,0.0007241627,0.0007728687,0.00006013139,0.000130945,0.511959,0.05581782,0.4299874],"study_design_scores_gemma":[0.002433592,0.0003593632,0.00002645226,0.0006214457,0.00004133568,0.00003986095,0.000002108316,0.02838645,0.0005539124,0.008987351,0.9574566,0.00109156],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001697992,0.0003025103,0.1175582,0.0002641669,0.0008098316,0.0006737357,0.0001569053,0.000570304,0.8796474],"genre_scores_gemma":[0.001786796,0.0001460169,0.0140254,0.001194561,0.000816913,0.00004158158,0.00006290078,0.0001537798,0.9817721],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9016387,"threshold_uncertainty_score":0.9996656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03655109184865478,"score_gpt":0.2513865106722297,"score_spread":0.2148354188235749,"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."}}