Efficient Wu Manber String Matching Algorithm for Large Number of Patterns
نویسندگان
چکیده
منابع مشابه
Efficient Wu Manber String Matching Algorithm for Large Number of Patterns
String matching is one of the most important concept used in computer science in various real life applications like as Intrusion detection system, Data mining, Plagiarism detection system. There are many string matching algorithms which help to find pattern from the text. These algorithms are categorized in single string matching and multiple string matching. The Wu-Manber (WM) algorithm is mu...
متن کاملHigh Concurrence Wu-Manber Multiple Patterns Matching Algorithm
Short patterns affect the performance of WuManber algorithm greatly. In order to solve this problem, an improved Wu-Manber algorithm is proposed. It divides all the patterns into different sets according to their length. For each set, independent data structures are established and different process methods are used. Because there are few resources shared among these sets, high concurrence is o...
متن کاملA Comparative Study of Wu Manber String Matching Algorithm and its Variations
String matching algorithms is become one of the most important topic in the computer science world. These algorithms are used in many real world problems like as scanning the threat in intrusion detection system, finding the pattern in text mining, match the similarity of the document in the plagiarism detection system, recognition in bio informatics and so on. String Matching Algorithms are br...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملOptimal Shift-Or String Matching Algorithm for Multiple Patterns
In this paper, we develop a new algorithm for handling multiple patterns, which is based on average optimal shift-or algorithm. We have assumed that the pattern representation fits into a single computer word and length of each pattern is equal. We have adopted the concept of classes of characters for handling multiple patterns. We compare the performance of the proposed algorithm with the stan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015907707