{"id":"W4400218314","doi":"10.3389/fbinf.2024.1391086","title":"Maximum-scoring path sets on pangenome graphs of constant treewidth","year":2024,"lang":"en","type":"article","venue":"Frontiers in Bioinformatics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; European Commission; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Natural Sciences and Engineering Research Council of Canada; Agentúra Ministerstva Školstva, Vedy, Výskumu a Športu SR; National Institutes of Health; National Human Genome Research Institute; Agentúra na Podporu Výskumu a Vývoja","keywords":"Treewidth; Constant (computer programming); Path (computing); Mathematics; Combinatorics; Partial k-tree; Pathwidth; 1-planar graph; Graph; Computer science; Chordal graph","routes":{"ca_aff":true,"ca_fund":true,"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.0005883505,0.0001746753,0.0002679923,0.0008868737,0.00005343465,0.0001067042,0.0008504472,0.00007441857,0.000004765103],"category_scores_gemma":[0.0000483898,0.0001505301,0.00009511771,0.001324488,0.0001797245,0.0007170702,0.0002025842,0.0002935535,0.00002280344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001003313,"about_ca_system_score_gemma":0.00009841867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002665486,"about_ca_topic_score_gemma":0.000001149845,"domain_scores_codex":[0.9983502,0.00004614733,0.0005033757,0.000212539,0.0004567682,0.0004309674],"domain_scores_gemma":[0.9990438,0.000120494,0.00008756022,0.000606184,0.00004477304,0.00009721783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004680317,0.00008066884,0.002751756,0.0006366046,0.00009572912,0.0001124748,0.006758088,0.0007255253,0.000103744,0.3863975,0.004423022,0.5978681],"study_design_scores_gemma":[0.0005858678,0.0004199115,0.0004513045,0.00065121,0.00001113243,0.00002434819,0.001857689,0.5052667,0.001398509,0.4843738,0.004504723,0.0004547917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01124278,0.001666343,0.9714847,0.000138151,0.001788719,0.000394608,0.00005162694,0.0002088998,0.01302421],"genre_scores_gemma":[0.2988731,0.0005156365,0.7002746,0.0001369151,0.00001821901,0.00002588628,0.000009726196,0.00002399699,0.0001219356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5974133,"threshold_uncertainty_score":0.613844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0175788546057046,"score_gpt":0.2658307626825963,"score_spread":0.2482519080768917,"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."}}