{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729523,0.001222399,0.001929566,0.001720665,0.001464745,0.002718903,0.002967382,0.002370287,0.01994482],"category_scores_gemma":[0.01117188,0.0006384304,0.001541752,0.003103167,0.0009874564,0.005887378,0.002880448,0.004250621,0.005304136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529674,"about_ca_system_score_gemma":0.002443458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003444994,"about_ca_topic_score_gemma":0.00443009,"domain_scores_codex":[0.9979852,0.0003483838,0.0001285736,0.0004829428,0.0007682714,0.0002864877],"domain_scores_gemma":[0.9943141,0.003133643,0.0001914639,0.001397442,0.0007137817,0.0002496524],"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.0008908182,0.0004343576,0.0007187941,0.0004695907,0.00008878247,0.0002037368,0.0002008572,0.05156026,0.009205783,0.07323705,0.05485438,0.8081356],"study_design_scores_gemma":[0.0005331786,0.000169416,0.000543571,0.00008711022,0.0001015669,0.000562217,0.0001580017,0.6431124,0.007221957,0.324354,0.02310523,0.00005140488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01945277,0.001122265,0.9571615,0.002146893,0.0006410961,0.0003171523,0.001057915,0.005038374,0.01306202],"genre_scores_gemma":[0.1249423,0.0003815228,0.8621234,0.0006085573,0.0004985108,0.0004183502,0.002503133,0.0009397857,0.007584363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01994482,"threshold_uncertainty_score":0.06672204,"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."}}