{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005130848,0.001767409,0.003587637,0.00195262,0.00260162,0.007427807,0.005469713,0.003579617,0.01502354],"category_scores_gemma":[0.05108801,0.001196134,0.002502336,0.005442751,0.003473654,0.02141277,0.003885397,0.005489084,0.001349185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005740596,"about_ca_system_score_gemma":0.006525215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006020892,"about_ca_topic_score_gemma":0.006233648,"domain_scores_codex":[0.9927238,0.002587775,0.0005173686,0.001491825,0.001624506,0.001054778],"domain_scores_gemma":[0.9297576,0.05829419,0.002782638,0.005622858,0.002186689,0.001355983],"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.002381964,0.0006945009,0.004952476,0.0008657182,0.0003593425,0.0003997753,0.0007780174,0.5859976,0.003186855,0.2854383,0.02277924,0.09216627],"study_design_scores_gemma":[0.0001917007,0.00009352026,0.0006455039,0.00004530969,0.00007467072,0.0001265829,0.0002137297,0.6025651,0.0008689812,0.393231,0.001907463,0.00003639222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4366393,0.004648034,0.5007979,0.01446331,0.0005997009,0.0005808231,0.005798258,0.002166563,0.03430616],"genre_scores_gemma":[0.8142553,0.002262437,0.1627016,0.001055073,0.0009470225,0.0006897203,0.007301442,0.00106961,0.009717708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01502354,"threshold_uncertainty_score":0.05025882,"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."}}