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

Authors

  • S Hrushikesava Raju
  • M Nagabhushana Rao Professor, Department of CSE, K L University, Vijayawada, A.P.

Keywords:

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

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.

References

Michael T.Good Rich and Roberto Tamassia,” Data Structures and Algorithms in java”,6th edition,2014.

Akepogu Ananda Rao,Radhika Raju Palagiri, ” Data Structures and Algorithms using C++”,Pearson,2010.

Donald Adjeroh, Timothy Bell and Amar Mukharjee,”TheBurrows Wheeler Transform”,Springer,

ISBN-13: 978-0387789088.

Machael McMillan,” Data Structures and Algorithms using Visual Basic.NET”,Cambridge, ISBN-13: 978-0521547659.

Svetlana, Eden,” Introduction to String Matching and modification in R using Regular expressions”, march,2007.

Jeffrey.E.F.Fredl,” Mastering Regular Expression” 3rd Edition, O,reilly publications, ISBN-13: 978-0596528126.

“Regular expressions and Matching”, http://modernperlbooks.com/books/modern_perl/chapter_06.html, Modern Perl 2011-12 edition.

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.

Micheline Kamber and Jiawei Han,”Data Mining Concepts and Techniques”,Second Edtion,Morgan Kaufmann Publishers, ISBN 13: 978-1-55860-901-3 .

Dorian Pyle,”Data preparation for Data Mining”, Morgan Kaufmann Publishers, Inc,1999.

Pang-Ning Tan, Vipin Kumar, Michael Steenbach, “Introduction to Data Mining”, Pearson,2006.

Jonathan M. Elchison, Dr. Shompe,” The Rabin Karp Algorithm:String Matching”, people.cedarville. edu/Employee /...web/.../rabin_karp_matching.ppt,2004

Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method,csnotes.upm.edu.my/...nsf/.../StringMatching%20-%20Part%201.ppt, ISSN:2278–132.

Katey Cruz,”String Matching using Rabin Karp Algorithm”, cs.smith.edu/~streinu/Teaching/Courses/252 /...af/CSC_252.PPT,2000.

Pattern Matching, Algorithms in C, gauss.ececs.uc.edu/ Courses /c472/lectures/.../21PatternMatching.pdf, pp.No 1- 15 and pp.no 26-pp.no-36.

Lecture Notes on Pattern Matching Algorithms, www.cosc.canterbury.ac.nz /tad.takaoka /cosc229 / patgeo.pdf, pp.no 48 – pp.no 54.

Downloads

Published

2025-11-11

How to Cite

[1]
S. Hrushikesava Raju and M. Nagabhushana Rao, “Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing”, Int. J. Comp. Sci. Eng., vol. 4, no. 11, pp. 100–106, Nov. 2025.

Issue

Vol. 4 No. 11 (2016): IJCSE November Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.