{"id":"W2128020980","doi":"10.1145/1132516.1132540","title":"Optimal phylogenetic reconstruction","year":2006,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Harvard University; National Science Foundation","keywords":"Tree (set theory); Phylogenetic tree; Markov chain; Mathematics; Combinatorics; Algorithm; Tree rearrangement; Sequence (biology); Discrete mathematics; Biology; Statistics; Genetics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00125014,0.0008301265,0.001405511,0.001725725,0.001050356,0.001486381,0.001466849,0.001927446,0.006307565],"category_scores_gemma":[0.01122188,0.0008040303,0.001016059,0.001862513,0.001309338,0.003871737,0.002245241,0.00191039,0.00229227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041145,"about_ca_system_score_gemma":0.001416166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001040454,"about_ca_topic_score_gemma":0.001319652,"domain_scores_codex":[0.9984642,0.0003717908,0.0001142807,0.000490933,0.0003461794,0.0002126596],"domain_scores_gemma":[0.9957813,0.002128988,0.0002501038,0.001216772,0.0004822611,0.0001404696],"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.0006789261,0.0001876672,0.003054662,0.0006016534,0.0001167378,0.000316448,0.0004990181,0.2092918,0.01686407,0.1904124,0.02070909,0.5572674],"study_design_scores_gemma":[0.00008980847,0.00009461533,0.0007993107,0.00006873179,0.000045569,0.0003540502,0.000212221,0.6167569,0.01026473,0.3589853,0.01228793,0.00004091243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0332933,0.0007365197,0.9583474,0.0005800194,0.00008530971,0.00007009278,0.000577439,0.001423256,0.004886576],"genre_scores_gemma":[0.2496082,0.0007285018,0.7406767,0.0003048582,0.0001187022,0.0001620822,0.002622701,0.0004674604,0.005310812],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006307565,"threshold_uncertainty_score":0.02110094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007480600463049214,"score_gpt":0.2068424045391989,"score_spread":0.1993618040761496,"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."}}