EFFICIENT SPARSE DYNAMIC PROGRAMMING FOR THE MERGED LCS PROBLEM WITH BLOCK CONSTRAINTS

Detecting the interleaving relationship between sequences has become important because of its wide applications to genomic and signal comparison. Given a target sequence T and two merging sequences A and B, recently Huang et al. propose algorithms for the merged LCS problem, without or with block constraint, whose aim, is to find the longest common subsequence (LCS) with interleaving relationship. Without block constraint, Huang's algorithm requires O(nmr)-time and O(mr)-space, where n = vertical bar T vertical bar, m and r denote the longer and shorter length of A and B, respectively. In this paper; for solving the problem without block constraint, we first propose an algorithm with O(Lnr) time and O(m + Lr) space. We also propose an algorithm to solve the problem, with block constraint. Our algorithms are more efficient than previous results, especially for sequences over large alphabets.