Multidimensional Longest Increasing Subsequences and Its Variants Discovery Using DNA Operations
The Multidimensional Longest Increasing Subsequence (MLIS) and Multidimensional Common Longest Increasing Subsequence (MCLIS) have their importance in many data mining applications. This work finds all increasing subsequences in n sliding window, longest increasing sequences in one and more sequences, decreasing subsequences and common increasing sequences of varied window sizes with one or more dimensions. The proposed work can be applied to finding diverging patterns, constraint MLIS, sequence alignment, find motifs in genetic databases, pattern recognition, mine emerging patterns, and contrast patterns in both, scientific and commercial databases. The algorithms are implemented and tested for accuracy in both real and simulated databases. Finally, the validity of the algorithms are checked and their time complexity are analyzed.
KeywordsLIS MLIS MLDS CMLIS Pattern recognition Molecular computing
Unable to display preview. Download preview PDF.
- 1.Murugan, A., Lavanya, B.: A DNA algorithmic approach to solve GCS problem. Journal of Computational Intelligence in Bioinformatics 3(2), 239–247 (2010)Google Scholar
- 2.Murugan, A., Lavanya, B., Shyamala, K.: A novel programming approach for DNA computing. International Journal of Computational Intelligence Research 7(2), 199–209 (2011)Google Scholar
- 4.Lavanya, B., Murugan, A.: A DNA based approach to find closed repetitive gapped subsequence from a sequence database. International Journal of Computer Applications 29(5), 45–49 (2011)Google Scholar
- 5.Lavanya, B., Murugan, A.: Discovery of longest increasing subsequences and its variants using DNA operations. International Journal of Engineering and Technology 5(2), 1169–1177 (2013)Google Scholar
- 6.Lavanya, B., Murugan, A.: Multidimensional longest common subsequence discovery from large databases using DNA operations. International Journal of Engineering and Technology 5(2), 1153–1160 (2013)Google Scholar
- 11.Hirosawa, et al.: Comprehensive study on iterative algorithms of multiple sequence alignment. Computational Applications in Biosciences 11, 13–18 (1995)Google Scholar
- 15.Tompa, M.: An exact method for finding short motifs in sequences with application to ribisome binding site problem. In: Proc. Seventh Int’l. Conf. Intelligent Systems for Molecular Biology, pp. 262–271 (1999)Google Scholar