{"id":"W1976933290","doi":"10.1007/s10878-008-9164-y","title":"Linear time construction of 5-phylogenetic roots for tree chordal graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta; McGill University","funders":"","keywords":"Phylogenetic tree; Combinatorics; Theory of computation; Mathematics; Chordal graph; Tree (set theory); Constructive; Discrete mathematics; Treewidth; Time complexity; Root (linguistics); Graph; Pathwidth; Computer science; Algorithm; Biology; Line graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0001946159,0.0001018545,0.0002084204,0.0001130859,0.00005457837,0.000005792554,0.0001242536,0.0001234206,0.00001620264],"category_scores_gemma":[0.0001526208,0.00009951254,0.0001546994,0.0001238831,0.0000716487,0.000008729692,0.00002004203,0.0000539204,6.453083e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001594965,"about_ca_system_score_gemma":0.0001344533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.223186e-7,"about_ca_topic_score_gemma":8.594378e-8,"domain_scores_codex":[0.9991266,0.00004636908,0.0004154595,0.0001066405,0.000191676,0.0001133074],"domain_scores_gemma":[0.9987313,0.00001457571,0.0004686168,0.0001166795,0.0005982366,0.00007059224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001845837,0.0006469397,0.005279678,0.00007832645,0.0005686902,0.000007449701,0.0001308024,0.2650216,0.7168691,0.001020666,0.003365474,0.005165499],"study_design_scores_gemma":[0.04171677,0.0205558,0.00690899,0.0001677576,0.0008589337,0.001114837,0.0001326662,0.1026712,0.7930055,0.01446534,0.01684427,0.001557951],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7514332,0.0005726553,0.2441107,0.0001254807,0.002897529,0.0004932471,0.00001831923,0.000007558376,0.0003413805],"genre_scores_gemma":[0.8346657,0.0004764495,0.1634988,0.0000174557,0.001102891,0.000007165105,0.00008826936,0.00003653444,0.0001067663],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1623504,"threshold_uncertainty_score":0.4058003,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007732445053198036,"score_gpt":0.2235730261570026,"score_spread":0.2158405811038045,"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."}}