{"id":"W2278303037","doi":"","title":"Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments (Extended Abstract)","year":2010,"lang":"en","type":"article","venue":"","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Intuition; Phylogenetic tree; Algorithm; Branching (polymer chemistry); Combinatorics; Tree (set theory); Mathematics; Binary logarithm; Computer science; Discrete 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.007706042,0.001674459,0.001509406,0.001895937,0.002040699,0.002549708,0.003001224,0.002292796,0.009366313],"category_scores_gemma":[0.02811011,0.0005833333,0.001503189,0.003875719,0.001556924,0.008183357,0.002057081,0.002964013,0.002687699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004116313,"about_ca_system_score_gemma":0.003847901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01244954,"about_ca_topic_score_gemma":0.009170607,"domain_scores_codex":[0.9943278,0.001602981,0.0004145324,0.0009979748,0.001837588,0.0008190505],"domain_scores_gemma":[0.9624819,0.02691036,0.001026496,0.004827644,0.00394434,0.0008092308],"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.003843945,0.002073284,0.008149367,0.001192845,0.0003236775,0.000251581,0.0004936034,0.2778783,0.01166567,0.03165241,0.06735823,0.595117],"study_design_scores_gemma":[0.000480686,0.0003067888,0.0009465033,0.00004633072,0.00006701474,0.0001472844,0.0001617444,0.9528687,0.008681351,0.03219277,0.004063146,0.00003769446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3269174,0.005340239,0.5953161,0.003268279,0.001236832,0.0007290997,0.003931535,0.03278637,0.03047417],"genre_scores_gemma":[0.4287193,0.0005885516,0.5621371,0.0004878417,0.0001725405,0.0004312568,0.003423658,0.001139137,0.002900571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01244954,"threshold_uncertainty_score":0.04075396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01527299345237267,"score_gpt":0.3148174384921325,"score_spread":0.2995444450397598,"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."}}