文章基本信息

标题：Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method
本地全文：下载
作者：S.Hrushikesava Raju ; T. Swarna Latha
期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2013
卷号：2
期号：2
页码：592-599
出版社：Shri Pannalal Research Institute of Technolgy
摘要：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.
关键词：Pattern Matching; Data Preprocessing; ; Time Complexity; Dynamic Search