{"id":"W2067190192","doi":"10.5555/338219.338265","title":"A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)","year":2000,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Tree (set theory); Algorithm; Evolutionary algorithm; Algorithm design; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0002430028,0.000111133,0.0001208262,0.00004053353,0.0002537992,0.00004804566,0.0005117778,0.00005949348,0.0002581429],"category_scores_gemma":[0.00002109288,0.00008190279,0.0000859915,0.0002544893,0.00009145385,0.000782495,0.00005400669,0.0001058423,0.0000469861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002954156,"about_ca_system_score_gemma":0.0001612263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007701671,"about_ca_topic_score_gemma":0.00001330374,"domain_scores_codex":[0.998917,0.00002554569,0.0002907696,0.0003217622,0.0002127444,0.0002321825],"domain_scores_gemma":[0.9988873,0.0002625573,0.00008079979,0.0005514103,0.0001305055,0.00008741652],"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.000006756507,0.0005477222,0.000008543696,0.000004152978,0.00002016829,0.000002409012,0.00006809043,0.00008854538,0.0002429807,0.02411413,0.00338668,0.9715098],"study_design_scores_gemma":[0.0005098649,0.0003400784,0.0174032,0.0000114777,0.00002326956,0.0001628995,0.0001958925,0.9157203,0.001912285,0.01804267,0.04543376,0.0002443379],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004719715,0.00005898735,0.9815938,0.005632766,0.00009537403,0.0004828752,0.00004421363,0.0001300242,0.007242187],"genre_scores_gemma":[0.06302251,0.0000455529,0.9338725,0.0001574896,0.0001721036,0.0001665165,0.0000348087,0.0000104571,0.002518111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9712655,"threshold_uncertainty_score":0.3339899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03176517682252492,"score_gpt":0.302588497937053,"score_spread":0.2708233211145281,"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."}}