eKMP: A Proposed Enhancement of KMP Algorithm

  • Nitashi Kalita
  • Chitra
  • Radhika Sharma
  • Samarjeet Borah
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 33)

Abstract

Exact sequence matching is a vital component of many problems, including text editing, information retrieval, signal processing and recently in bioinformatics applications. Various sequence matching or string matching algorithms are found in literature. The reliability of these algorithms constantly depends on the ability to detect the presence of match characters and the ability to discard any mismatch characters. These algorithms are widely used for searching of an unusual sequence in a given DNA sequence. In this paper, a proposed enhancement over KMP algorithm is presented. It is carried out to bring completeness to the parent algorithm.

Keywords

Algorithm Boyer-Moore DNA sequencing eKMP KMP LCS 

References

  1. 1.
    Li, H., Homer, N.: A survey of sequence alignment algorithms for next-generation sequencing. Brief. Bioinform 11, 473–483 (2010)CrossRefGoogle Scholar
  2. 2.
    Johnstone, J.: A survey of sequence matching and alignment algorithms. url:https://people.ok.ubc.ca/rlawrenc/teaching/404/Project/Samples/Report/SequenceMatching_Report.pdf
  3. 3.
    Das, M.K., Dai, H.K.: A survey of DNA motif finding algorithms. Proceedings of the fourth annual MCBIOS conference. Computational frontiers in biomedicine. BMC Bioinform. 8(Suppl 7), S21 (2007). doi: 10.1186/1471-2105-8-S7-S21
  4. 4.
    Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)CrossRefMathSciNetMATHGoogle Scholar
  5. 5.
    Boyer, R.S., Smoore, J.: A fast string-searching algorithm. Commun. Assoc. Comput. Mach. 20, 762–772 (1977)Google Scholar
  6. 6.
    Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18(6), 341–343 (1975)CrossRefMathSciNetMATHGoogle Scholar
  7. 7.
    Knuth–Morris–Pratt Algorithm. url:http://en.wikipedia.org/wiki/Knuth–Morris-Pratt_algorithm. Accessed 12 Sept 2014
  8. 8.
    Cao, M.: Time complexity of Knuth-Morris-Pratt string matching algorithm. Course Project Report for COMP-160. Tufts University, Medford, USA. url:http://www.eecs.tufts.edu/~mcao01/2010f/COMP-160.pdf (2010)

Copyright information

© Springer India 2015

Authors and Affiliations

  • Nitashi Kalita
    • 1
  • Chitra
    • 1
  • Radhika Sharma
    • 1
  • Samarjeet Borah
    • 2
  1. 1.Department of Computer Science and EngineeringSikkim Manipal Institute of TechnologySikkimIndia
  2. 2.Department of Computer ApplicationsSikkim Manipal Institute of TechnologySikkimIndia

Personalised recommendations