{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00167807,0.0006017781,0.0005335397,0.0006453362,0.000462913,0.0008138259,0.003071847,0.0004497371,0.000007663438],"category_scores_gemma":[0.0001862393,0.0005191782,0.0001092297,0.0003250372,0.0007556585,0.0005651994,0.002126845,0.0009639331,0.000003984846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002023641,"about_ca_system_score_gemma":0.0002537672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001399612,"about_ca_topic_score_gemma":0.00004927874,"domain_scores_codex":[0.996276,0.00004135045,0.0005180562,0.001669966,0.000764831,0.0007298412],"domain_scores_gemma":[0.9972939,0.0007275665,0.0003790169,0.001111597,0.0003076498,0.0001803083],"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.00001111148,0.00002350535,0.00001724577,0.00005932824,0.00001266464,0.00002993781,0.001263505,0.0001664905,0.00160052,0.05492311,0.000009188087,0.9418834],"study_design_scores_gemma":[0.0004267997,0.0002550272,0.00002813219,0.0005957641,0.00001093523,0.00008454386,6.298928e-7,0.24556,0.03882001,0.7128713,0.0004964472,0.0008503561],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008520346,0.002605236,0.9944028,0.0002860982,0.001200555,0.0008146147,0.000007545568,0.0003646688,0.0002332646],"genre_scores_gemma":[0.03479045,0.00001262542,0.9636639,0.0008734426,0.0004050588,0.00002055053,0.000007897827,0.00003983515,0.0001862835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9410331,"threshold_uncertainty_score":0.999726,"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."}}