{"id":"W2037968786","doi":"10.1016/s0022-0000(03)00078-3","title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Southeast Fisheries Science Center","keywords":"Parameterized complexity; Combinatorics; Longest common subsequence problem; Alphabet; Mathematics; Sequence (biology); Subsequence; Discrete mathematics; Biology; Genetics","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.002389308,0.0001748319,0.0004201671,0.00008478585,0.0005583684,0.0004675139,0.00157977,0.00004497973,0.000001965757],"category_scores_gemma":[0.00003658526,0.00008121676,0.00008451517,0.0004291325,0.001073265,0.0005990492,0.0003031442,0.0002307632,5.71121e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002508097,"about_ca_system_score_gemma":0.0001020055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000614888,"about_ca_topic_score_gemma":0.00001241909,"domain_scores_codex":[0.9975501,0.0006387925,0.0006069323,0.0002758775,0.0006932274,0.000235091],"domain_scores_gemma":[0.9980454,0.0006880417,0.0005612278,0.0004587963,0.000136298,0.0001101957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000394333,0.0002885869,0.0511069,0.0002519882,0.00008545555,0.00006798549,0.003264406,0.002812968,0.004877517,0.9225376,0.001094238,0.01357297],"study_design_scores_gemma":[0.002408261,0.004346396,0.1546685,0.004789976,0.0000874859,0.006721364,0.001467532,0.7662385,0.007367019,0.04954441,0.001302289,0.001058314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9333168,0.0006595729,0.0636157,0.001071249,0.0006950746,0.0002742839,0.000007185147,0.00001581143,0.0003443419],"genre_scores_gemma":[0.9876013,0.00003204457,0.01214637,0.0001761095,0.00003483626,0.000002238449,1.671085e-7,0.000003273857,0.000003638755],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8729931,"threshold_uncertainty_score":0.4508248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05730906861657043,"score_gpt":0.2577674707612815,"score_spread":0.2004584021447111,"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."}}