Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 2
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.
Authors and Affiliations
S. Hrushikesava Raju , Dr. T. Swarna Latha,
Keywords
Related Articles
- EP ID EP130926
- DOI -
- Views 80
- Downloads 0
Advanced Technique of Digital Watermarking based on SVD-DWT-DCT and Arnold Transform
With the growing popularity of internet and digital media, we propose a method of non-blind transform domain watermarking which is based on the Direction Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and...
DATA SECURITY USING CRYPTOGRAPHY AND STEGNOGRAPHY
Steganography and Cryptography are two popular ways of sending vital information in a secret way. One hides the existence of the message and the other distorts the message itself. There are many cryptographic tec...
VisualRank for Image Retrieval from Large-Scale Image Database
VisualRank provide ranking among images to be retrieved by measuring common visual features of the images. The similarity between images is measured by measuring similarity within extracted features like Texture, C...
Hybrid Movement Control Algorithm For Restoring Connectivity In WSAN
Maintaining inter-actor connectivity is very important in WSAN. Failure of one or multiple actors may partition the inter-actor network and obstruct the network operation. This paper presents a combination of two...
SOFTWARE MODULE CLUSTERING USING SINGLE AND MULTI-OBJECTIVE APPROACHES
Most of the interesting software systems are very large and complex which is difficult to understand their structure. Complexity occurs due to having entities that depend on each other in intricate ways in source cod...