Lower Bounds and Parameterized Approach for Longest Common Subsequence

DOI10.1007/11809678_16zbMath1162.68453OpenAlexW1529415861MaRDI QIDQ3591322

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

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

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