Multidimensional Longest Increasing Subsequences and Its Variants Discovery Using DNA Operations

  • Balaraja Lavanya
  • Annamalai Murugan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8284)

Abstract

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.

Keywords

LIS MLIS MLDS CMLIS Pattern recognition Molecular computing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    Delcher, A.L., Kasif, S., Feischmann, R.D., Peterson, J., White, O., Salzberg, S.L.: Alignment of whole genomes. Nucleic Acids Research 27, 2369–2376 (1999)CrossRefGoogle Scholar
  4. 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. 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. 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
  7. 7.
    Schensted, C.: Longest increasing and decreasing subsequences. Can. J. Math 13, 179–191 (1961)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Crochemore, M., Porat, E.: Fast computation of longest increasing subsequences and application. Information and Computation 208, 1054–1059 (2010)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Knuth, D.E.: Permutations,matricesand generalized young tableaux. Pacific. J. Math 34, 709–727 (1970)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Esmaieli, M., Tarafdar, M.: Sequential pattern mining from multidimensional sequence data in parallel. International Journal of Computer Theory and Engineering 2(5), 730–733 (2010)CrossRefGoogle Scholar
  11. 11.
    Hirosawa, et al.: Comprehensive study on iterative algorithms of multiple sequence alignment. Computational Applications in Biosciences 11, 13–18 (1995)Google Scholar
  12. 12.
    De B. Robinson, G.: On representation of symmetric group. Am. J. Math 60, 745–760 (1938)CrossRefGoogle Scholar
  13. 13.
    Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics 11(1), 29–35 (1975)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Wang, L., Jiang, T.: On the complexity of multiple sequence alignment. Journal of Computational Biology 1, 337–348 (1994)CrossRefGoogle Scholar
  15. 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
  16. 16.
    Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Information Processing Letters 76(1-2), 7–11 (2000)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Communications of ACM 20(5), 350–353 (1977)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Balaraja Lavanya
    • 1
  • Annamalai Murugan
    • 1
  1. 1.Department of Computer ScienceUniversity of MadrasChennaiIndia

Personalised recommendations