{"id":"W3174688402","doi":"10.1007/978-3-030-79987-8_23","title":"Complexity and Algorithms for MUL-Tree Pruning","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Pruning; Tree (set theory); Parameterized complexity; Set (abstract data type); Heuristic; Computer science; Algorithm; Search tree; Tree rearrangement; Weight-balanced tree; K-ary tree; Combinatorics; Mathematics; Binary tree; Phylogenetic tree; Artificial intelligence; Tree structure; Binary search tree; Biology; Gene; Search algorithm; Botany","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.002669002,0.001945709,0.002659206,0.003181389,0.002124304,0.007792594,0.005746466,0.003124179,0.02230224],"category_scores_gemma":[0.02190671,0.001523514,0.003102159,0.007011414,0.003165422,0.01738444,0.004627776,0.008138208,0.005157188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004291043,"about_ca_system_score_gemma":0.002383575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002581218,"about_ca_topic_score_gemma":0.003333845,"domain_scores_codex":[0.9951882,0.0009334731,0.0003420476,0.0006920611,0.002354692,0.0004894555],"domain_scores_gemma":[0.9800181,0.01452054,0.0005230813,0.003247863,0.001388026,0.0003024621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003873719,0.0002064012,0.0007657667,0.0007247074,0.00008728716,0.0001287793,0.0002868955,0.06493353,0.002787444,0.6078733,0.04395466,0.2778638],"study_design_scores_gemma":[0.00004334083,0.00002932984,0.0002506982,0.00007069277,0.00005298847,0.0002067657,0.00005492375,0.1781702,0.001500236,0.809786,0.009806701,0.00002811573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01676988,0.005172778,0.9115703,0.003211654,0.0006030106,0.0002487828,0.001398871,0.001945048,0.05907975],"genre_scores_gemma":[0.1460496,0.004964078,0.8003206,0.0009993396,0.0015608,0.0007936648,0.00350638,0.001784554,0.04002106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02230224,"threshold_uncertainty_score":0.07460845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04652306749869173,"score_gpt":0.2811639945158672,"score_spread":0.2346409270171754,"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."}}