{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008023351,0.0009489472,0.001445825,0.001099705,0.001048323,0.001872772,0.002756906,0.00159538,0.01491026],"category_scores_gemma":[0.004768678,0.000885183,0.001309278,0.001434149,0.001018428,0.003140165,0.003574461,0.001852279,0.002894428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826206,"about_ca_system_score_gemma":0.001938872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001854867,"about_ca_topic_score_gemma":0.00517662,"domain_scores_codex":[0.9991196,0.0001613081,0.00005122486,0.0002605719,0.0001929535,0.0002143659],"domain_scores_gemma":[0.996585,0.001897025,0.0002788904,0.0005919367,0.0002852287,0.0003617919],"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.002475612,0.001036831,0.006685603,0.00262857,0.0002468338,0.0005884745,0.001808812,0.1666687,0.08597558,0.1696047,0.03932408,0.5229563],"study_design_scores_gemma":[0.0009086793,0.000863198,0.004481699,0.0002362618,0.0002997573,0.0005327656,0.001391661,0.5417827,0.045882,0.3786089,0.02488074,0.0001316438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3672346,0.0007082193,0.5924688,0.001777739,0.0001684692,0.001079995,0.004194965,0.005348315,0.02701895],"genre_scores_gemma":[0.3643394,0.0003105302,0.6210495,0.0002732119,0.00005205209,0.0003901185,0.005191972,0.0006455412,0.007747671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01491026,"threshold_uncertainty_score":0.04987973,"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."}}