{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001615186,0.001244491,0.002377378,0.001653434,0.00135454,0.002173503,0.003635169,0.00215784,0.006646494],"category_scores_gemma":[0.01027791,0.0008941725,0.001471088,0.002640398,0.00106507,0.003521251,0.003593347,0.002334578,0.002405919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001494217,"about_ca_system_score_gemma":0.001793595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361648,"about_ca_topic_score_gemma":0.003539342,"domain_scores_codex":[0.9979576,0.0004050622,0.0001449009,0.0005521624,0.0005829326,0.0003572971],"domain_scores_gemma":[0.9927395,0.003492395,0.0005438427,0.002059241,0.0008821497,0.000282967],"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.0005977851,0.0002432322,0.001384328,0.0003088916,0.00008078038,0.00008817574,0.0003769705,0.2217166,0.01045785,0.02202869,0.01022059,0.7324961],"study_design_scores_gemma":[0.0001780204,0.0001211751,0.0005466116,0.00002588676,0.00004814902,0.0001617083,0.0001846026,0.9226132,0.007200158,0.06483356,0.004053115,0.00003379901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02019551,0.0004233176,0.973264,0.0002223122,0.00005669353,0.0001124293,0.0001200722,0.003536842,0.002068819],"genre_scores_gemma":[0.1382028,0.0002486534,0.8572754,0.0001263481,0.00005311331,0.0002518269,0.000841357,0.0005950934,0.002405343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006646494,"threshold_uncertainty_score":0.02223468,"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."}}