{"id":"W1582613544","doi":"10.1007/978-3-642-13193-6_13","title":"Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Intuition; Algorithm; Phylogenetic tree; Computer science; Branching (polymer chemistry); Tree (set theory); Combinatorics; Running time; Mathematics; Chemistry","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.008767871,0.002297585,0.002663105,0.00271687,0.003483663,0.004533391,0.004522709,0.003605631,0.01574115],"category_scores_gemma":[0.03446086,0.0009639564,0.002513802,0.005654799,0.002235376,0.01571394,0.003114188,0.005065412,0.003990282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00575572,"about_ca_system_score_gemma":0.00637418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01027237,"about_ca_topic_score_gemma":0.01024236,"domain_scores_codex":[0.9918339,0.001999607,0.0005402026,0.001670734,0.002803104,0.001152436],"domain_scores_gemma":[0.9312489,0.04920665,0.001591647,0.01065327,0.005656128,0.001643459],"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.009425295,0.003076727,0.005339752,0.001716785,0.0003990401,0.0001855583,0.0008014074,0.1828876,0.01175173,0.07520239,0.07401741,0.6351963],"study_design_scores_gemma":[0.001479731,0.0008286405,0.001244896,0.0001303515,0.0002344177,0.0003058561,0.0005114748,0.7991072,0.01358199,0.1761278,0.006362903,0.0000846781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3288214,0.009400561,0.5818942,0.003474923,0.001927062,0.0008426591,0.006153489,0.02516451,0.04232114],"genre_scores_gemma":[0.4774668,0.001324679,0.5059555,0.0004721866,0.0003567972,0.0004501075,0.005436265,0.00205041,0.006487318],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01574115,"threshold_uncertainty_score":0.05265933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01600844997577217,"score_gpt":0.2930123744161025,"score_spread":0.2770039244403303,"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."}}