{"id":"W2126358107","doi":"10.1007/978-3-642-04241-6_32","title":"A Unifying View on Approximation and FPT of Agreement Forests","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bisection; Tree (set theory); Time complexity; Combinatorics; Computer science; Physics; Mathematics; Geometry","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.000574022,0.0003234472,0.0003928725,0.0005055829,0.0001456835,0.0002196588,0.001469795,0.0001586663,0.000005742996],"category_scores_gemma":[0.00003243759,0.0002638991,0.00005603656,0.0003056889,0.0002507439,0.0004794853,0.0008819762,0.0003507306,0.000006397625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009833648,"about_ca_system_score_gemma":0.0001470918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001230515,"about_ca_topic_score_gemma":0.00002112297,"domain_scores_codex":[0.9975038,0.00002393132,0.0004110155,0.0009421902,0.0008027328,0.0003163645],"domain_scores_gemma":[0.9983041,0.0001917589,0.000301631,0.0009762429,0.000124334,0.0001018916],"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.000003284114,0.00002156029,0.00001266233,0.00004627525,0.000002931107,0.00001235688,0.0002214396,0.003963694,0.00004572813,0.02267892,0.000009430919,0.9729817],"study_design_scores_gemma":[0.0003058404,0.0004693032,0.000823594,0.001607819,0.000006402606,0.00003146896,1.061715e-7,0.7949361,0.001208809,0.1986216,0.001537568,0.0004513224],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001283722,0.0006485545,0.9963483,0.0003275934,0.0003666119,0.0003260855,0.000003896937,0.00004396348,0.001806678],"genre_scores_gemma":[0.1352339,0.000250123,0.8628975,0.001146794,0.0002595152,0.000007177328,0.00001346892,0.0000214001,0.0001701984],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9725304,"threshold_uncertainty_score":0.9999813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02124145712904562,"score_gpt":0.2559367173408361,"score_spread":0.2346952602117904,"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."}}