We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

ASCII KS Discrete Matcher: A Different and a New Approach to String Matching using Pattern in Discrete Manner

by Kuljinder Singh Bumrah, Saurabh Rawat, Anushree Sah, Sumit Pundir
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 56 - Number 2
Year of Publication: 2012
Authors: Kuljinder Singh Bumrah, Saurabh Rawat, Anushree Sah, Sumit Pundir
10.5120/8863-2826

Kuljinder Singh Bumrah, Saurabh Rawat, Anushree Sah, Sumit Pundir . ASCII KS Discrete Matcher: A Different and a New Approach to String Matching using Pattern in Discrete Manner. International Journal of Computer Applications. 56, 2 ( October 2012), 18-19. DOI=10.5120/8863-2826

@article{ 10.5120/8863-2826,
author = { Kuljinder Singh Bumrah, Saurabh Rawat, Anushree Sah, Sumit Pundir },
title = { ASCII KS Discrete Matcher: A Different and a New Approach to String Matching using Pattern in Discrete Manner },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 56 },
number = { 2 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 18-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume56/number2/8863-2826/ },
doi = { 10.5120/8863-2826 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:57:50.728393+05:30
%A Kuljinder Singh Bumrah
%A Saurabh Rawat
%A Anushree Sah
%A Sumit Pundir
%T ASCII KS Discrete Matcher: A Different and a New Approach to String Matching using Pattern in Discrete Manner
%J International Journal of Computer Applications
%@ 0975-8887
%V 56
%N 2
%P 18-19
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Many researchers have implemented string matching algorithms in various fields for instance finding the secret key RSA or other encryption methods as well as finding intruder's pattern in Intrusion Detection System, DNA matching, Carbon Chain matching. This paper aims to analyze and obtain an algorithm for discrete pattern matching. It also works for any type of string whether it be characters, decimal values or special symbols.

References
  1. Research article An Efficient ASCII-Based Algorithm for Single Pattern Matching (Rami H. Mansi and Jehad Q. Alnihoud)
  2. Knuth, D. , Morris, J. H. , Pratt, V. , Fast pattern matching in strings, SIAM Journal on Computing, Vol. 6, No. 2, pp. 323–350, doi:10. 1137/0206024, 1977.
  3. D. E. Knuth, J. H. M. Jr. , and V. R. Pratt, . Fast pattern matching in strings,. SIAM J. Comput. , vol. 6, no. 2, pp. 323. 350, June 1977.
  4. R. S. Boyer and J. S. Moore, . A fast string matching algorithm,. Commun. ACM, vol. 20, no. 10, pp. 762. 772, October 1977.
  5. Z. Galil and J. Seiferas, . Time-space optimal string matching (preliminary report),. in STOC, 1981.
  6. Karp, R. M. , Rabin, M. O. , Efficient randomized pattern-matching algorithms, IBM J. Res. Dev. , Vol. 31, No. 2, pp. 249-260, 1987
  7. D. M. Sunday, . A very fast substring search algorithm,. Commun. ACM,vol. 33, no. 8, pp. 132. 142, August 1990.
  8. M. Crochemore and D. Perrin, . Two-way string matching,. J. ACM, vol. 38, no. 3, pp. 650. 674, 1991.
  9. N. T. et. al. , . Deterministic memory-ef_cient string matching algorithms for intrusion detection,. INFOCOM, 2004.
  10. Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin
  11. Introduction to Algorithms by Thomas H. Cormen
  12. S Lipschutz and M. Lipson, Discrete Mathematics
  13. A. Aho and M. Corasick. Efficient string matching: an aid to bibliographic search. CACM, 18(6):333–340, June 1975.
  14. A. Amir, A. Butman, and M. Lewenstein. Real scaled matching. In Proc. SODA 2000, page To appear. ,San Francisco, January 2000.
  15. A. Amir and G. Calinescu. Alphabet independent and dictionary scaled matching. In Proc. CPM'96,number 1075 in LNCS, pages 320–334, 1996.
  16. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of non-rectangular figures. InProc. SODA'91, pages 212–223, 1991.
  17. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. TheoreticalComputer Science, 81:97–115, 1991.
  18. M. Atallah. A linear time algorithm for the Hausdorff distance between convex polygons. InformationProcessing Letters, 17:207–209, 1983.
  19. R. Baeza-Yates. Similarity in two-dimensional strings. In Proc. COCOON'98, number 1449 in LNCS,pages 319–328, Taipei, Taiwan, August 1998.
  20. R. Baeza-Yates and G. Navarro. Multiple approximate string matching. In Proc. WADS'97, LNCS1272, pages 174–184, 1997.
Index Terms

Computer Science
Information Sciences

Keywords

ASCII KS

Powered by PhDFocusTM