{"id":"W2092368578","doi":"10.1142/s0218213005002351","title":"A COLLAPSING METHOD FOR THE EFFICIENT RECOVERY OF OPTIMAL EDGES IN PHYLOGENETIC TREES","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Caprion (Canada)","funders":"","keywords":"Phylogenetic tree; Computer science; Context (archaeology); Inference; Set (abstract data type); Tree (set theory); Mathematical proof; Binary number; Algorithm; Enhanced Data Rates for GSM Evolution; Binary tree; Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence; Biology; Paleontology","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.0006537432,0.00009899898,0.0001655768,0.00009785115,0.00003766693,0.00004000949,0.0004165745,0.00005348649,0.00001480605],"category_scores_gemma":[0.0004409079,0.00007517503,0.0001771404,0.00006796872,0.00007716168,0.000002471663,0.00007280343,0.00006712024,0.000001216174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003012369,"about_ca_system_score_gemma":0.00009755781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001082324,"about_ca_topic_score_gemma":0.0000754021,"domain_scores_codex":[0.9988938,0.00004532754,0.0006055407,0.0001303671,0.000190384,0.0001345695],"domain_scores_gemma":[0.9987975,0.0002913888,0.0003163326,0.0001012841,0.0004663037,0.00002720648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003848787,0.00008523957,0.0001351965,0.000002077793,0.0001278115,0.000001259709,0.0002047046,0.3505616,0.3789654,0.0002623423,0.00005798034,0.2692115],"study_design_scores_gemma":[0.0001395685,0.0004871732,0.001412126,0.00003607533,0.00003327463,0.00004294666,0.0006882049,0.01697975,0.9741445,0.0007239798,0.005197139,0.0001152733],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7423229,0.001866214,0.2538303,0.001037976,0.0006574114,0.0001688128,0.00003320327,5.687584e-7,0.00008258926],"genre_scores_gemma":[0.9673029,0.0003552405,0.03149721,0.00008883629,0.0006981468,0.000008754841,0.000001770034,0.000009082773,0.00003802751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5951791,"threshold_uncertainty_score":0.3065549,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04881618195269857,"score_gpt":0.3405609273709421,"score_spread":0.2917447454182435,"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."}}