{"id":"W3131672637","doi":"10.1007/s00453-022-01007-w","title":"Algorithms and Complexity on Indexing Founder Graphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"H2020 European Research Council; Academy of Finland; Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; European Commission; Helsingin Yliopisto","keywords":"Combinatorics; Cograph; Time complexity; Discrete mathematics; Mathematics; Chordal graph; Pathwidth; Parameterized complexity; Indifference graph; Computer science; Line graph; 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.004565897,0.001620767,0.00263967,0.00249791,0.002598987,0.007370998,0.007359908,0.003531888,0.01331414],"category_scores_gemma":[0.03147686,0.001412689,0.003088431,0.006445182,0.002919333,0.01719525,0.00525449,0.004069333,0.003046234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005219081,"about_ca_system_score_gemma":0.00465969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006304863,"about_ca_topic_score_gemma":0.006926771,"domain_scores_codex":[0.9901351,0.002013086,0.0007630078,0.003116391,0.002682258,0.001290157],"domain_scores_gemma":[0.9551994,0.02944701,0.00229052,0.009827364,0.002087653,0.00114808],"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.001805902,0.001176338,0.008761927,0.002592187,0.0003664039,0.000712795,0.002553703,0.190148,0.01780723,0.2996193,0.06773815,0.4067181],"study_design_scores_gemma":[0.0003102826,0.0001371738,0.0008827383,0.0001143551,0.0001630016,0.0004659965,0.0005059963,0.431045,0.006920817,0.549639,0.009751837,0.00006382371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2932613,0.002567451,0.6374441,0.01165848,0.0003931643,0.001004167,0.008716582,0.01935394,0.02560092],"genre_scores_gemma":[0.4289674,0.001090075,0.5386304,0.001381839,0.0002918367,0.0006284805,0.01451231,0.002679726,0.01181792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01331414,"threshold_uncertainty_score":0.04454017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04296810111341419,"score_gpt":0.2634721082878823,"score_spread":0.2205040071744681,"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."}}