{"id":"W2062214685","doi":"10.1007/s00224-007-1329-z","title":"A Faster FPT Algorithm for the Maximum Agreement Forest Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Partition (number theory); Combinatorics; Cardinality (data modeling); Phylogenetic tree; Mathematics; Time complexity; Order (exchange); Binary number; Running time; Set (abstract data type); Algorithm; Pairwise comparison; Computer science; Statistics; Chemistry; Data mining","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.004441482,0.0001823529,0.0002725608,0.00008884665,0.0002972208,0.0001417035,0.001326722,0.00006077657,0.000002442075],"category_scores_gemma":[0.000018,0.0001163357,0.0001096507,0.0002054768,0.00008199493,0.0001773241,0.0004864645,0.0001109875,0.00001234579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003652105,"about_ca_system_score_gemma":0.00003637314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004993234,"about_ca_topic_score_gemma":0.000003120674,"domain_scores_codex":[0.9981308,0.0001250742,0.0005696355,0.0003467797,0.0003940283,0.000433703],"domain_scores_gemma":[0.9974259,0.00116198,0.0003631155,0.0007997769,0.0001748228,0.00007438366],"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.00001974305,0.00007396864,0.0000757517,0.0001124027,0.00006900489,0.000004496803,0.001625706,0.002407191,0.0001239663,0.1919388,0.0009102648,0.8026387],"study_design_scores_gemma":[0.0007068893,0.0002131929,0.001066662,0.0003220066,0.00001976189,0.00004578444,0.0005608189,0.9676607,0.0002940334,0.0154655,0.01340186,0.0002428029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001733458,0.0006182146,0.9939879,0.0000802282,0.001276722,0.000891523,0.000009399927,0.000103035,0.001299586],"genre_scores_gemma":[0.7694824,0.00000390157,0.2292921,0.0001176546,0.0005902268,0.00002113542,0.000007480704,0.00002110794,0.0004640488],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9652535,"threshold_uncertainty_score":0.4744031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01855616429137116,"score_gpt":0.2557037684314387,"score_spread":0.2371476041400675,"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."}}