MULTIDIMENSIONAL LONGEST COMMON SUBSEQUENCE DISCOVERY From LARGE DATABASE USING DNA OPERATIONS

The problem of analysis of biological sequences, is the discovery of sequence similarity of various kinds, in the primary structure of related proteins and genes. This sequence search can be applied to various applications like discovery of association rules, strong rules, correlations, sequential rules, frequent episodes, multidimensional patterns and many other important discovery tasks. In this paper we have proposed two new approaches to find multidimensional LCS and SCS, of N sequences parallely, using DNA operations. These approaches can be used to find MLCS and MSCS, of any window size, from any number of sequences, and from any type of input data. The proposed work can be applied to finding diverging patterns, constraint MLCS, and many more related patterns Implementation results shown the correctness of the algorithms. Finally, the validity of the algorithms are checked and their time complexity is analyzed.