Lower Bounds and Parameterized Approach for Longest Common Subsequence

DOI10.1007/11809678_16MaRDI QIDQ3591322zbMATH OpenOpenAlexFDO

Authors Xiuzhen Huang

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_16

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• The parameterized complexity of sequence alignment and consensus
• On the Longest Common Parameterized Subsequence
• On the longest common parameterized subsequence
• Algorithms for Computing the Longest Parameterized Common Subsequence
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

Cited in

(7)

• On the longest common parameterized subsequence
• The parameterized complexity of sequence alignment and consensus
• Algorithms for Computing the Longest Parameterized Common Subsequence
• On the Longest Common Parameterized Subsequence
• On the parameterized complexity of the repetition free longest common subsequence problem
• Parameterized complexity and approximability of the longest compatible sequence problem
• Multivariate fine-grained complexity of longest common subsequence

This page was built for publication: Lower Bounds and Parameterized Approach for Longest Common Subsequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591322)