Dominant point-based sequential and parallel algorithms for the multiple sequential substring constrained-LCS problem

The Longest Common Subsequence (LCS) problem is a well-known and studied problem in computer science and bioinformatics. It consists in finding the longest subsequence that is common to two or more given sequences. In this article, we address the problem of finding all LCS for the Sequential Substring Constrained-LCS (SSCLCS) problem, called the Multiple SSCLCS problem. To solve this problem, we first propose a dominant point-based sequential algorithm, designed on a new Leveled Direct Acyclic Graph (DAG) that gives the correct evaluation order of subproblems to avoid redundancy due to overlap. Depending on whether the constraints may overlap or not, it requires \ (O (S| |^K+1+r+n| |) \) and \ (O (S| |^K+1+n| |) \) time with \ (O (Max\ₗevel+n| |) \) space. S is the number of partial SSCLCS in a node, K is the number of DAG levels, n is the length of sequences, r is the total length of constraints, \ (Max\ₗevel\) is the number of nodes in the largest level of the DAG, and \ (| |\) is the length of the alphabet. Then, we derive a coarse-grained multicomputer parallel solution requiring \ (O (S| |^K+1+r+n| |p) \) and \ (O (S| |^K+1+n| |p) \) execution time, \ (O (Max\ₗevel+n| |) \) memory space and \ (O (K) \) communication rounds. p is the number of processors. Experimental results showed that the parallel algorithm is, respectively, 14. 43× and 19. 19× faster than the sequential algorithm on 32 and 64 processors.