{"id":"W2108529076","doi":"10.1145/508791.508827","title":"Optimal algorithms for local vertex quartet cleaning","year":2002,"lang":"en","type":"article","venue":"","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Merge (version control); Vertex (graph theory); 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.001739661,0.001187049,0.001987531,0.001540047,0.001218984,0.001827144,0.003343225,0.002099195,0.007805268],"category_scores_gemma":[0.01042092,0.0007411286,0.001339192,0.002462169,0.001137462,0.003109137,0.003468526,0.002207396,0.002529972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001391861,"about_ca_system_score_gemma":0.001748128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002163278,"about_ca_topic_score_gemma":0.002716849,"domain_scores_codex":[0.9980031,0.0004311165,0.0001471687,0.0005492435,0.000555669,0.0003136724],"domain_scores_gemma":[0.9916603,0.004117889,0.0006546373,0.002189728,0.001050096,0.0003273032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006166777,0.0002741031,0.001605232,0.0003901405,0.00008825112,0.0001038933,0.0003820192,0.2184281,0.01012165,0.01975245,0.01079914,0.7374384],"study_design_scores_gemma":[0.0002129162,0.000137049,0.000714687,0.00003313882,0.00005924643,0.0002403493,0.0001803183,0.9240192,0.009174318,0.06070255,0.004489124,0.00003716288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01756816,0.0003266279,0.9769232,0.0001973928,0.00004596229,0.0001052742,0.000104203,0.002764774,0.001964428],"genre_scores_gemma":[0.1251357,0.0001801836,0.8709763,0.000120969,0.00005266138,0.0002303351,0.0007405758,0.0004780707,0.00208517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007805268,"threshold_uncertainty_score":0.02611119,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02206175454258625,"score_gpt":0.2426180232249621,"score_spread":0.2205562686823759,"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."}}