{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003953428,0.0002306803,0.0002363947,0.0002120798,0.00109371,0.0002075799,0.001072611,0.00004660522,0.0001472331],"category_scores_gemma":[0.00001079895,0.0002221254,0.00007284643,0.0005238492,0.0001209492,0.0004458616,0.001929205,0.0004707908,0.00002617083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008207976,"about_ca_system_score_gemma":0.00005425257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001249305,"about_ca_topic_score_gemma":0.000002226985,"domain_scores_codex":[0.997751,0.0001591371,0.0002572753,0.0007390228,0.000661988,0.0004315819],"domain_scores_gemma":[0.9987618,0.0001462161,0.0001112565,0.0007609245,0.0000437448,0.0001760964],"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.00001965827,0.0002794735,0.0001449554,0.00001017428,0.00004684299,0.0001101221,0.0005442039,0.000153324,0.0001291942,0.3147577,0.006797504,0.6770069],"study_design_scores_gemma":[0.001461983,0.0008735747,0.004610464,0.00002307552,0.0000142121,0.0003149012,0.0002187896,0.6787039,0.0004459829,0.2105216,0.1019536,0.0008578969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01145559,0.0004768537,0.9763445,0.003070334,0.001716624,0.0005308336,0.0001304016,0.000688223,0.005586679],"genre_scores_gemma":[0.5740055,0.00005119395,0.4194655,0.00493794,0.0003523146,0.0002098156,0.0001186683,0.00006873098,0.0007903341],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6785506,"threshold_uncertainty_score":0.9058009,"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."}}