{"id":"W122288055","doi":"10.1007/978-3-642-03367-4_21","title":"Efficient Construction of Near-Optimal Binary and Multiway Search Trees","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Binary search tree; Optimal binary search tree; Upper and lower bounds; Binary tree; Binary number; Weight-balanced tree; Random binary tree; Tree (set theory); Search tree; Ternary search tree; Node (physics); Self-balancing binary search tree; Mathematics; Computer science; Search algorithm; Combinatorics; Algorithm; Interval tree; Engineering","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.0005838528,0.000452475,0.001376772,0.001276915,0.0007775227,0.001497777,0.001504769,0.001183554,0.00538442],"category_scores_gemma":[0.004694851,0.0006920974,0.0007409888,0.00223733,0.0006325687,0.002579608,0.002407362,0.001248158,0.001743298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008289563,"about_ca_system_score_gemma":0.001244837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000721874,"about_ca_topic_score_gemma":0.002075152,"domain_scores_codex":[0.9991261,0.0001809743,0.0000689436,0.0001391755,0.0003446457,0.0001401094],"domain_scores_gemma":[0.9983549,0.0007450997,0.0001060898,0.0004120317,0.0002814594,0.0001005126],"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.0007866226,0.0002980172,0.001382386,0.0006452264,0.00005571851,0.0001898737,0.0004369667,0.1089072,0.02935582,0.1492403,0.02378872,0.6849131],"study_design_scores_gemma":[0.000151705,0.0002089919,0.0009654186,0.0001119384,0.00006225528,0.0004338473,0.0002183107,0.7776378,0.01556203,0.1850559,0.01954161,0.00005007675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1023285,0.001874422,0.8739252,0.0005362967,0.0001646958,0.0001934724,0.001042279,0.003471711,0.01646337],"genre_scores_gemma":[0.256336,0.0005706045,0.7344253,0.0001521098,0.00006217579,0.0002236396,0.001518647,0.0005049015,0.00620662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00538442,"threshold_uncertainty_score":0.01801264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01324337182029575,"score_gpt":0.2460546382725785,"score_spread":0.2328112664522828,"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."}}