{"id":"W1518466950","doi":"10.1007/11557067_6","title":"A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Branch and bound; Consistency (knowledge bases); Set (abstract data type); Algorithm; Heuristic; Construct (python library); Computer science; Scheme (mathematics); Running time; Upper and lower bounds; Mathematics; Mathematical optimization; Artificial intelligence","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009314031,0.0004687174,0.000436128,0.0002979038,0.0007412715,0.00106058,0.003060847,0.0002157236,0.000009409382],"category_scores_gemma":[0.00003504068,0.0003485646,0.0001262945,0.0004047306,0.001112761,0.0005168633,0.0009068348,0.0005512204,0.00002771677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001208409,"about_ca_system_score_gemma":0.0004957092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004579705,"about_ca_topic_score_gemma":0.0001147005,"domain_scores_codex":[0.9967429,0.00001730782,0.000512927,0.001486836,0.0006002842,0.0006397573],"domain_scores_gemma":[0.9967808,0.00103925,0.000258604,0.001535137,0.0002311453,0.0001550293],"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":[8.358958e-7,0.000018663,0.000001566137,0.00001590826,0.00001231458,0.000003581534,0.000347961,0.0003417091,0.00001108382,0.02769707,0.0001066227,0.9714427],"study_design_scores_gemma":[0.0002853172,0.0001412998,0.00003007917,0.0001532984,0.00001934842,0.0001162874,4.520915e-7,0.7388425,0.00007968323,0.2181821,0.04167419,0.0004754195],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003156861,0.001628469,0.9906341,0.004653884,0.0006446166,0.0009849833,0.00006569866,0.0001344693,0.00125065],"genre_scores_gemma":[0.001074987,0.0001381558,0.995365,0.001816695,0.0007015818,0.0001241672,0.00001425689,0.00003388716,0.000731256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9709673,"threshold_uncertainty_score":0.9999764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01864115444346768,"score_gpt":0.2553862308276432,"score_spread":0.2367450763841755,"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."}}