{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005785127,0.0003635118,0.0004519365,0.0005292,0.0002740826,0.0003279864,0.001556524,0.0002341983,0.000009895155],"category_scores_gemma":[0.00002900252,0.0003073463,0.00007721411,0.0004220292,0.001331373,0.0002787946,0.001447885,0.000540219,0.00000628802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009178768,"about_ca_system_score_gemma":0.0003476461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003474125,"about_ca_topic_score_gemma":0.000006441073,"domain_scores_codex":[0.9970415,0.00003636776,0.0004317177,0.001166641,0.0008840285,0.0004397814],"domain_scores_gemma":[0.9982092,0.0002558918,0.0002092372,0.0009645766,0.0002053837,0.0001556588],"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.000008325417,0.000030223,0.00003175468,0.00001967407,0.000004068811,0.00003192323,0.0004161492,0.1566855,0.000342096,0.00380858,0.000004841778,0.8386169],"study_design_scores_gemma":[0.0002708386,0.0003037592,0.0009152961,0.0003198874,0.000004660684,0.0001010869,3.507639e-7,0.9917814,0.001110729,0.004580908,0.0002787153,0.0003324032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005769064,0.0006212854,0.9919677,0.0002714309,0.0006235861,0.000259232,0.00001098309,0.00007355086,0.0004031007],"genre_scores_gemma":[0.1116875,0.00005538194,0.8878978,0.0001345073,0.0001431383,0.000001692825,0.00000518617,0.00001408035,0.00006065964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8382845,"threshold_uncertainty_score":0.9999379,"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."}}