{"id":"W2002094114","doi":"10.1007/s00453-015-9983-z","title":"Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Theory of computation; Algorithm; Mathematics; Approximation algorithm; Binary number; Binary tree; Tree (set theory); Combinatorics; Branching (polymer chemistry); Weight-balanced tree; Binary logarithm; Binary search tree; Computer science","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.0003147997,0.0001127885,0.0001418795,0.00002411852,0.00004146813,0.00001466908,0.0001025428,0.0001025987,0.000001476092],"category_scores_gemma":[0.0002630095,0.00008943619,0.00005668313,0.00004253795,0.00006447069,0.000003799312,0.000109073,0.00003695511,0.000001111746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007554891,"about_ca_system_score_gemma":0.00001952046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001362558,"about_ca_topic_score_gemma":0.000009174722,"domain_scores_codex":[0.9992218,0.0000357857,0.0002133729,0.0002624083,0.00008674389,0.0001798581],"domain_scores_gemma":[0.9995078,0.00004965931,0.0001062613,0.0001459751,0.0001163473,0.0000739844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001402461,0.0001698278,0.005787305,0.00006586812,0.000101655,0.000001187037,0.0001914055,0.0001158393,0.1808892,0.0001395175,0.001113985,0.811284],"study_design_scores_gemma":[0.004887207,0.004087333,0.01513979,0.00008141251,0.00009811038,0.00003713239,0.0006934006,0.211778,0.7355491,0.008796257,0.01795347,0.000898824],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8470994,0.0003544198,0.1516807,0.0001110593,0.0001142536,0.0003614117,0.00002494576,0.00001228157,0.00024147],"genre_scores_gemma":[0.8908262,0.000006365068,0.1086703,0.00006595791,0.0001781829,0.00002933917,0.0001219864,0.000008679213,0.00009300268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8103852,"threshold_uncertainty_score":0.3647102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04039927411750235,"score_gpt":0.2900088708665171,"score_spread":0.2496095967490147,"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."}}