{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007063081,0.0004331216,0.0003255394,0.0001358845,0.00009914937,0.00007059352,0.0003652581,0.0006059245,0.0001338086],"category_scores_gemma":[0.00001718775,0.0004322424,0.0001470554,0.00003596079,0.0001900643,0.0000103559,0.0002008664,0.000219291,0.00008767814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008101023,"about_ca_system_score_gemma":0.0001216572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009955883,"about_ca_topic_score_gemma":0.00002450089,"domain_scores_codex":[0.9983004,0.00004303897,0.0002572016,0.0008235633,0.0001731125,0.0004026282],"domain_scores_gemma":[0.9990848,0.00002072714,0.0001725869,0.0003193695,0.0002075487,0.0001949834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005692714,0.0007680964,0.003541147,0.0003234695,0.003724499,0.00006475809,0.0002851922,0.008813783,0.3096762,0.03881872,0.1539387,0.4794762],"study_design_scores_gemma":[0.000587856,0.001273239,0.0136949,0.00001998558,0.00005531803,0.00003764412,0.00001277536,0.0003123376,0.00006180366,0.0109815,0.972029,0.0009335891],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.4603193,0.1255718,0.1954658,0.01727145,0.007766187,0.02111764,0.01561789,0.001191339,0.1556786],"genre_scores_gemma":[0.3745476,0.0005603924,0.08965193,0.002063972,0.002362435,0.0004225211,0.1006138,0.0003450094,0.4294323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8180904,"threshold_uncertainty_score":0.999813,"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."}}