{"id":"W1502442151","doi":"10.1007/11602613_74","title":"5-th Phylogenetic Root Construction for Strictly Chordal Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chordal graph; Pairwise comparison; Phylogenetic tree; Computer science; Closeness; Time complexity; Theoretical computer science; Combinatorics; Graph; Block graph; Split graph; Discrete mathematics; Mathematics; Artificial intelligence; 1-planar graph; Biology","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.0002482073,0.000351582,0.0002627463,0.0003037776,0.0001261272,0.00008554242,0.00063306,0.0003382325,0.00001980145],"category_scores_gemma":[0.00003310749,0.0003472528,0.0001434828,0.0001466944,0.0004859049,0.00000585977,0.0002392124,0.0002107402,0.000007029463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006980469,"about_ca_system_score_gemma":0.0002248989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003651415,"about_ca_topic_score_gemma":0.0000727917,"domain_scores_codex":[0.9979988,0.00001232044,0.0002851263,0.000952866,0.0003179211,0.0004329976],"domain_scores_gemma":[0.9990016,0.00003216926,0.0001599847,0.0005388723,0.0001716933,0.00009570403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003331801,0.00003437579,0.0004507112,0.00004931318,0.00005519207,0.000004851416,0.00005636735,0.01204248,0.03846559,0.0007902339,0.00007073203,0.9479468],"study_design_scores_gemma":[0.007732497,0.006671325,0.005247163,0.0006681613,0.0003683899,0.0006603297,0.000002545439,0.06764212,0.3686423,0.2011555,0.3336332,0.007576406],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006481192,0.001529822,0.9885901,0.0001230766,0.001301457,0.0006886577,0.00003824396,0.00002106425,0.001226435],"genre_scores_gemma":[0.4303968,0.0005060232,0.5622807,0.0008844512,0.003955147,0.0000751304,0.0002737108,0.0001419089,0.001486077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9403704,"threshold_uncertainty_score":0.999898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00968951747809062,"score_gpt":0.2312686381177686,"score_spread":0.2215791206396779,"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."}}