Novel Pattern Matching Algorithm for Single Pattern Matching
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 8
Abstract
Pattern matching is one of the important issues in the areas of network security and many others. The increase in network speed and traffic may cause the existing algorithms to become a performance bottleneck. Therefore, it is very necessary to evelop more efficient pattern matching algorithm, in order to overcome troubles on performance. There are several lgorithms in use, in which, some are with different ethodology and other are with the improved methodology for the existing algorithms. In this paper, we are proposing a novel pattern matching algorithm, called, DP algorithm (Devaki – Paul algorithm). The algorithm works basing on some novel set of innovated rules, which will endorse the algorithm resulting in better performance and efficiency. In case of unsuccessful search, the DP algorithm has zero character comparisons, irrespective of the sizes of the text and pattern, provided if either the first or the last character was not present in the given input text. Whereas, the Booyer-Moore and Quick Search algorithms will do search as usual. The algorithm also doesn’t require any pre-processing phase, if the search is on the same given input text and with different patterns, provided the first and the last characters are same as in the case of first pattern. The algorithm was tested and validated and the results have proved that the performance of DP algorithm is better than BM algorithm (Boyer – Moore algorithm) and Quick Search lgorithm. In case of tests with repeated character, its erformance is greater than 1%~50% with BM and Quick earch algorithms. In case of tests with the English Text and Random Pattern, it’s greater than 33%~91% with BM and 37%~85% with Quick Search algorithms. In case of tests with the English Text and Random Pattern of an unsuccessful search, its performance is greater than BM and Quick Search algorithms with 100%, if either the first and/or the last character of the pattern in the given text were not present.
Authors and Affiliations
Devaki Pendlimarri , Paul Bharath Bhushan Petlu
Keywords
Related Articles
- EP ID EP97290
- DOI -
- Views 128
- Downloads 0
DIGITAL IMAGE PROCESSING TECHNIQUES FOR DETECTION AND REMOVAL OF NOISE IN IMAGES IMPLEMENTING BLIND SOURCE SEPARATION
In different fields, the problem of Blind Source Separation (BSS) is known as a collection of linear combinations of unknown sources and worse the coefficients of the linear combinations that are unknown. The main proble...
Building an OSS Quality Estimation Model with CATREG
Open Source Software (OSS) has been a popular form in software development. In this paper, we use statistical approaches to derive OSS quality estimation models. Our objective is to build estimation models for the numbe...
Performance Of OLSR Routing Protocol Under Different Route Refresh Intervals In Ad Hoc Networks
An ad hoc wireless network consists of mobile terminals communicating with each other without the help of traditional infrastructure for communication. Optimized Link State Protocol (OLSR) is a proactive routing protoco...
SECURE ROUTING IN WIRELESS SENSOR NETWORKS: ROUTING PROTOCOLS
A Secure Routing capabilities on the order of Node to Base Station will be capable of both wired connectivity to the internet as well as wireless connectivity to the sensor network. One aspects of sensor networks organiz...
Test Model for Text Categorization and Text Summarization
Text Categorization is the task of automatically sorting a set of documents into categories from a predefined set and Text Summarization is a brief and accurate representation of input text such that the output covers th...