{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392086,0.001327338,0.001372606,0.002363817,0.00106628,0.001395835,0.00205082,0.001670845,0.00354115],"category_scores_gemma":[0.01035731,0.001018972,0.00129827,0.002950564,0.001260229,0.004919608,0.002626034,0.001757175,0.0006107372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000953331,"about_ca_system_score_gemma":0.0008872506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001176929,"about_ca_topic_score_gemma":0.001810339,"domain_scores_codex":[0.9989497,0.0002777118,0.00006255179,0.0003908711,0.0002169221,0.0001022071],"domain_scores_gemma":[0.9934636,0.004512753,0.0006897727,0.0006586789,0.0004004727,0.000274653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006644999,0.0003504592,0.00611619,0.001349238,0.000244167,0.0006212047,0.001003162,0.5032544,0.02454758,0.1369907,0.01108368,0.3137748],"study_design_scores_gemma":[0.0000756053,0.0001206815,0.0009881736,0.00006385515,0.00004863341,0.0003510229,0.0002164422,0.6181858,0.006144991,0.3697589,0.00402064,0.00002522905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1524564,0.000583654,0.8412794,0.0006515199,0.00002962002,0.0002825791,0.001245619,0.001213514,0.002257718],"genre_scores_gemma":[0.2602966,0.0005119554,0.7314967,0.0002045734,0.00004855552,0.0003989772,0.003877517,0.0004279602,0.002737269],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00354115,"threshold_uncertainty_score":0.0118463,"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."}}