CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Exact Multiple Pattern Matching Algorithm using DNA Sequence and Pattern Pair

by Raju Bhukya, DVLN Somayajulu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 17 - Number 8
Year of Publication: 2011
Authors: Raju Bhukya, DVLN Somayajulu
10.5120/2239-2862

Raju Bhukya, DVLN Somayajulu . Exact Multiple Pattern Matching Algorithm using DNA Sequence and Pattern Pair. International Journal of Computer Applications. 17, 8 ( March 2011), 32-38. DOI=10.5120/2239-2862

@article{ 10.5120/2239-2862,
author = { Raju Bhukya, DVLN Somayajulu },
title = { Exact Multiple Pattern Matching Algorithm using DNA Sequence and Pattern Pair },
journal = { International Journal of Computer Applications },
issue_date = { March 2011 },
volume = { 17 },
number = { 8 },
month = { March },
year = { 2011 },
issn = { 0975-8887 },
pages = { 32-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume17/number8/2239-2862/ },
doi = { 10.5120/2239-2862 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:05:04.895403+05:30
%A Raju Bhukya
%A DVLN Somayajulu
%T Exact Multiple Pattern Matching Algorithm using DNA Sequence and Pattern Pair
%J International Journal of Computer Applications
%@ 0975-8887
%V 17
%N 8
%P 32-38
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Exact string matching algorithms are essential components in DNA applications of the computational biology. Pattern matching is an important task of the pattern discovery process in today's world for finding the structural and functional behavior in proteins and genes. Although pattern matching is commonly used in computer science and information processing, it can be found in everyday tasks. Molecular biologists often search for the important information from the databases in different directions of different uses. With the increasing need for instant information, pattern matching will continue to grow and change as needed from time to time. In this research we propose a new pattern matching technique called an Exact multiple pattern matching algorithms using DNA sequence and pattern pair. The current approach is used to avoid unnecessary comparisons in the DNA sequence. Due to this, the number of comparisons gradually decreases and comparison per character ratio of the proposed algorithm reduces accordingly when compared to the some of the existing popular methods. Proposed algorithm is implemented and compared with existing algorithms. Comparison results demonstrate that index based algorithm is efficient than the number of the existing techniques.

References
  1. Aho, A. V., and M. J. Corasick, ‘‘Efficient string matching: an aid to bibliographic Search, ’’ Communications of the ACM 18 (June 1975), pp. 333 340.
  2. Berry, T. and S. Ravindran, 1999. A fast string matching algorithm and experimental results. In: Proceedings of the Prague Stringology Club Workshop ’99, Liverpool John Moores University, pp: 16-28.
  3. Boyer R. S., and J. S. Moore, ‘‘A fast string searching algorithm‘Communications of the ACM 20, 762- 772, 1977.
  4. D.M. Sunday, A very fast substring search algorithm, Comm. ACM 33 (8) (1990) 132–142.
  5. Devaki-Paul, “Novel Devaki-Paul Algorithm for Multiple Pattern Matching” International Journal of Computer Applications (0975 – 8887) Vol 13– No.3, January 2011
  6. Horspool, R.N., 1980. Practical fast searching in strings. Software practice experience, 10:501-506
  7. Knuth D., Morris. J Pratt. V Fast pattern matching in strings, SIAM Journal on Computing, Vol 6(1), 323-350, 1977.
  8. Kurtz. S, Approximate string searching under weighted edit distance. In proceedings of the 3rd South American workshop on string processing. Carleton Univ Press, pp. 156-170, 1996
  9. Needleman, S.B Wunsch, C.D(1970). “A general method applicable to the search for similarities in the amino acid sequence of two proteins.” J.Mol.Biol.48,443-453.
  10. Raita, T. Tuning the Boyer-Moore-Horspool string-searching algorithm. Software - Practice Experience 1992, 22(10), 879-884.
  11. Raju Bhukya, DVLN Somayajulu,”An Index Based K-Partition Multiple Pattern Matching Algorithm”, Proc. of International Conference on Advances in Computer Science 2010 pp 83-87.
  12. Smith,T.F and waterman, M (1981). Identification of common molecular subsequences T.mol.Biol.147,195-197.
  13. Ukkonen,E., Finding approximate patterns in strings J.Algor. 6, 1985, 132-137.
  14. Ziad A.A Alqadi, Musbah Aqel & Ibrahiem M.M.EI Emary, Multiple Skip Multiple Pattern Matching algorithms. IAENG International. Vol 34(2),2007.
Index Terms

Computer Science
Information Sciences

Keywords

Comparisons DNA Sequence Index

Powered by PhDFocusTM