Parallel computing for the longest common subsequences in network intrusion detection system

The longest common subsequence problem has been applied to network instruction detection system, bioinformatics and e-commerce, etc. This paper proposes an extended longest common subsequence problem called (K,1)-LCS problem, designs a parallel algorithm to solve (K,1)-LCS problem on SMP machine by the divide and conquer strategy and the tournament tree, and then presents a parallel algorithm for solving (K,1)-LCS problem on SMP clusters by applying the k-selection technique based on mesh-connected network. The theoretical analysis and experiments on Dawning-2000 parallel computer show that the parallel algorithm obtains a linear speedup and has a very good scalability.