Open Access   Article Go Back

Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing

S.H. Raju1 , M.N. Rao2

Section:Research Paper, Product Type: Journal Paper
Volume-4 , Issue-11 , Page no. 100-106, Nov-2016

Online published on Nov 29, 2016

Copyright © S.H. Raju, M.N. Rao . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: S.H. Raju, M.N. Rao, “Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing,” International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.100-106, 2016.

MLA Style Citation: S.H. Raju, M.N. Rao "Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing." International Journal of Computer Sciences and Engineering 4.11 (2016): 100-106.

APA Style Citation: S.H. Raju, M.N. Rao, (2016). Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing. International Journal of Computer Sciences and Engineering, 4(11), 100-106.

BibTex Style Citation:
@article{Raju_2016,
author = {S.H. Raju, M.N. Rao},
title = {Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {11 2016},
volume = {4},
Issue = {11},
month = {11},
year = {2016},
issn = {2347-2693},
pages = {100-106},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1115},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1115
TI - Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing
T2 - International Journal of Computer Sciences and Engineering
AU - S.H. Raju, M.N. Rao
PY - 2016
DA - 2016/11/29
PB - IJCSE, Indore, INDIA
SP - 100-106
IS - 11
VL - 4
SN - 2347-2693
ER -

VIEWS PDF XML
1477 1330 downloads 1279 downloads
  
  
           

Abstract

There are various pattern matching algorithms which take more comparisons in finding a given pattern in the text and are static and restrictive. In order to search pattern or substring of a pattern in the text with less number of comparisons, a general data mining technique is used called data preprocessing which named as D-PM using DP with help of one time look indexing method. The D-PM using DP finds given pattern or substring of given pattern in the text in less time and the time complexity involved is less than existing pattern matching algorithms. The new Pattern Matching Algorithm with data preprocessing (D-PM using DP) proposes Pattern Matching with dynamic search behavior and makes users should have flexibility in searching.

Key-Words / Index Term

Pattern Matching, Data Preprocessing (DP), Time Complexity, Comparisons, Onetime look Indexing

References

[1] Michael T.Good Rich and Roberto Tamassia,� Data Structures and Algorithms in java�,6th edition,2014.
[2] Akepogu Ananda Rao,Radhika Raju Palagiri, � Data Structures and Algorithms using C++�,Pearson,2010.
[3] Donald Adjeroh, Timothy Bell and Amar Mukharjee,�TheBurrows Wheeler Transform�,Springer,
ISBN-13: 978-0387789088.
[4] Machael McMillan,� Data Structures and Algorithms using Visual Basic.NET�,Cambridge, ISBN-13: 978-0521547659.
[5] Svetlana, Eden,� Introduction to String Matching and modification in R using Regular expressions�, march,2007.
[6] Jeffrey.E.F.Fredl,� Mastering Regular Expression� 3rd Edition, O,reilly publications, ISBN-13: 978-0596528126.
[7] �Regular expressions and Matching�, http://modernperlbooks.com/
[8] S. S. Sheik,Sumit K. Aggarwal,Anindya Poddar, N. Balakrishnan,and K. Sekar,�A FAST Pattern Matching Algorithm�,http://www.ijcta.com/documents/volumes/vol2issue6/ijcta2011020624.pdf, J. Chem. Inf. Comput. Sci. 2004, 44, 1251-1256.
[9] Micheline Kamber and Jiawei Han,�Data Mining Concepts and Techniques�,Second Edtion,Morgan Kaufmann Publishers, ISBN 13: 978-1-55860-901-3 .
[10] Dorian Pyle,�Data preparation for Data Mining�, Morgan Kaufmann Publishers, Inc,1999.
[11] Pang-Ning Tan, Vipin Kumar, Michael Steenbach, �Introduction to Data Mining�, Pearson,2006.
[12] Jonathan M. Elchison, Dr. Shompe,� The Rabin Karp Algorithm:String Matching�, people.cedarville. edu
[13] Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method,csnotes.upm.edu.my
[14] Katey Cruz,�String Matching using Rabin Karp Algorithm�, cs.smith.edu /...af/CSC_252.PPT,2000.
[15]Pattern Matching, Algorithms in C, gauss.ececs.uc.edu
[16] Lecture Notes on Pattern Matching Algorithms, www.cosc.canterbury.ac.nz