{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003033403,0.000928188,0.001449383,0.001698666,0.001708556,0.003065443,0.001971214,0.00218891,0.008967566],"category_scores_gemma":[0.01886715,0.0009301229,0.00121863,0.004892699,0.003113645,0.01000183,0.003316154,0.006319797,0.005934227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001652727,"about_ca_system_score_gemma":0.001243219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666405,"about_ca_topic_score_gemma":0.00136155,"domain_scores_codex":[0.9970553,0.0009860384,0.000166928,0.0004261595,0.001150263,0.0002153528],"domain_scores_gemma":[0.9910913,0.00638467,0.0002369929,0.001477442,0.0006465648,0.0001630185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009785243,0.00004033916,0.0003381733,0.0002085045,0.00002235555,0.000221792,0.000184991,0.02385724,0.001605275,0.8593633,0.02543971,0.08862046],"study_design_scores_gemma":[0.00003572856,0.0000590113,0.0002381882,0.0001273884,0.0000190962,0.0006551173,0.00003818721,0.0851025,0.00209114,0.8343026,0.07728741,0.00004373215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0115804,0.02017013,0.8662139,0.005600022,0.001877106,0.0001886358,0.0006717726,0.001522945,0.09217505],"genre_scores_gemma":[0.2510659,0.03535181,0.5975785,0.005715583,0.006679737,0.001031544,0.001939635,0.002516601,0.0981208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008967566,"threshold_uncertainty_score":0.02999955,"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."}}