{"id":"W4254176277","doi":"10.1145/508820.508827","title":"Optimal algorithms for local vertex quartet cleaning","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Vertex (graph theory); Merge (version control); Algorithm; Computer science; Set (abstract data type); Tree (set theory); Mathematics; Theoretical computer science; 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.0002616854,0.0002786228,0.0002581974,0.00005607781,0.0002570994,0.00004813444,0.0008479712,0.0002092622,0.00001812534],"category_scores_gemma":[0.00007485767,0.0002439892,0.0001913837,0.0001685392,0.0001669645,0.000004082299,0.0003715793,0.0001865646,0.00002293323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003954368,"about_ca_system_score_gemma":0.00001695013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002736243,"about_ca_topic_score_gemma":7.204735e-7,"domain_scores_codex":[0.9983467,0.000007279059,0.0003845643,0.0005338318,0.0002720284,0.0004555688],"domain_scores_gemma":[0.9990878,0.00003777725,0.0002719588,0.0003379576,0.000164736,0.00009973624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003588083,0.0005872509,0.0004575411,0.0002650108,0.0002544285,3.920041e-7,0.0008446685,0.06851377,0.8139374,0.008754065,0.0810989,0.02492776],"study_design_scores_gemma":[0.002653138,0.001104838,0.0005176261,0.0001173182,0.0001142226,0.00003626954,0.0006939413,0.7831116,0.1934331,0.000578894,0.01680246,0.0008366517],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.866542,0.0005277699,0.07171646,0.002741699,0.001194266,0.002131654,0.00006627347,0.0002263993,0.05485348],"genre_scores_gemma":[0.9819241,0.00003483906,0.01602101,0.0005098428,0.0002947631,0.00002257771,0.0000106519,0.00005407136,0.001128174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7145978,"threshold_uncertainty_score":0.9949592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01288127476735251,"score_gpt":0.2331799155235623,"score_spread":0.2202986407562098,"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."}}