Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

An Index based Pattern Matching using Multithreading

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 50 - Number 6
Year of Publication: 2012
Authors:
S. Nirmala Devi
S. P. Rajagopalan
10.5120/7774-0857

Nirmala S Devi and S P Rajagopalan. Article: An Index based Pattern Matching usingMultithreading. International Journal of Computer Applications 50(6):13-17, July 2012. Full text available. BibTeX

@article{key:article,
	author = {S. Nirmala Devi and S. P. Rajagopalan},
	title = {Article: An Index based Pattern Matching usingMultithreading},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {50},
	number = {6},
	pages = {13-17},
	month = {July},
	note = {Full text available}
}

Abstract

Pattern matching, the problem of finding sub sequences within a long sequence is essential for many applications such as information retrieval, disease analysis, structural and functional analysis, logic programming, theorem-proving, term rewriting and DNA-computing. In computational biology the essential components for DNA applications is the exact string matching algorithms. Many databases like GenBank were built by researchers for DNA and protein sequences; the string matching problem is the core problem for searching these databases. As the size of the database grows, the more important research area is to design an efficient string matching algorithms. This paper proposes a new pattern matching technique called An Index based Pattern matching using Multithreading for DNA sequences. The method specified in this paper performs parallel string searching using multiple threads simultaneously, each thread is responsible for searching one part of the text. . The proposed algorithm is an efficient algorithm that can be used to search for exact occurrences of patterns in DNA sequences.

References

  • Dan Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, New York, 1997.
  • Knuth D. , Morris. J Pratt. V Fast pattern matching in strings, SIAM journal on computing.
  • Boyer R. ande Moore J. , "A Fast String Searching Algorithm,"Computer Journals of Communications of the ACM, vol. 20, no. 10, pp. 762-772, 1997.
  • Christian Charras, "Brute Force algorithm. http://www-igm. univmlv-fr/~lecroq/string/node3. html#SECTION0030. .
  • Raju Bhukya,DVLN Somayajulu,"An Index Based K-Partitions Multiple Pattern matching Algorithm", Proc. of Int. Conf. on Adfvances in Computer Science 2010.
  • Deitel P. and Deitel H. , Java How to Program, Prentice Hall, 2003.
  • T. Ungerer,," A Survey of Processors with Explicit Multithreading", ACM Computing Surveys, Vol. 35, No. 1, March 2003, pp. 29–63.
  • Ziad A. A. Alqadi, "Multiple Skip Multiple Pattern Matching Algorithm ", IAENG International Journal of Computer Science, 34:2, IJCS_34_2_03, Advance online publication: 17 November 2007.
  • Deusdado, S. and Carvalho, P. (2009) 'GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences', Int J. Bioinformatics Research and Applications, Vol.