Tight Hardness Results for LCS and Other Sequence Similarity Measures

The problem Constrained Longest Common Subsequence is a natural extension to the classical problem Longest Common Subsequence, and has important applications to bioinformatics. Given k input sequences A"1,...,A"k and l constraint sequences B"1,...,B"l, ...

The problem of the longest common subsequence (LCS) is a fundamental problem in sequence alignment. In this paper, we first present fast parallel algorithms for sequence similarity with LCS. For two sequences of lengths m and n (m ≤ n), the algorithm ...

The problem of finding the longest common subsequence (LCS) of two given strings <em>A</em><Subscript>1</Subscript>and <em>A</em><Subscript>2</Subscript>is a well-studied problem. The constrained longest common subsequence (C-LCS) for three strings <em>...