{"id":"W155408510","doi":"10.1007/978-1-4471-5298-9_3","title":"How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree","year":2013,"lang":"en","type":"book-chapter","venue":"Computational biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tree (set theory); Phylogenetics; Maximum parsimony; Evolutionary biology; Phylogenetic tree; Computer science; Dynamic programming; Theoretical computer science; Genetic programming; Biology; Artificial intelligence; Algorithm; Mathematics; Combinatorics; Genetics; Clade; Gene","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.001530712,0.0009259859,0.001230131,0.001100234,0.0007163887,0.002674686,0.002420996,0.001622461,0.007376613],"category_scores_gemma":[0.00567143,0.001226746,0.001553037,0.001758609,0.001451243,0.005316445,0.001685646,0.003537992,0.00199855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007236356,"about_ca_system_score_gemma":0.0009760569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001598206,"about_ca_topic_score_gemma":0.002812693,"domain_scores_codex":[0.9995387,0.0001312038,0.00003043337,0.0001644558,0.0001043045,0.00003110828],"domain_scores_gemma":[0.9986842,0.00102261,0.00005196127,0.0001224328,0.00006899102,0.00004977965],"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.0001341852,0.00008495519,0.0009514045,0.0004945368,0.0001857395,0.0001310587,0.0002733038,0.2934246,0.004317239,0.1704981,0.0180988,0.511406],"study_design_scores_gemma":[0.00002468079,0.00001566422,0.0001370646,0.00005191228,0.00004177563,0.00009293775,0.00004521341,0.5887569,0.00158672,0.4016187,0.007601755,0.00002684681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003542644,0.0005329983,0.9923673,0.0006090071,0.00005406151,0.00002139421,0.0001576861,0.0007561136,0.00195873],"genre_scores_gemma":[0.0282349,0.0005775371,0.9684554,0.0001408325,0.00005843092,0.00007693642,0.0003113768,0.000670002,0.001474587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007376613,"threshold_uncertainty_score":0.02467722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01091562138572523,"score_gpt":0.2514840910126411,"score_spread":0.2405684696269159,"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."}}