|International Journal of Computer Applications
|Foundation of Computer Science (FCS), NY, USA
|Volume 132 - Number 17
|Year of Publication: 2015
|Authors: Vasudha Bhardwaj, Vikram Garg
Vasudha Bhardwaj, Vikram Garg . A Comparative Study of Wu Manber String Matching Algorithm and its Variations. International Journal of Computer Applications. 132, 17 ( December 2015), 34-38. DOI=10.5120/ijca2015907708
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 broadly categorized into single pattern string matching and multiple pattern string matching algorithms. To get the faster solution of the problem most of the cases multiple pattern matching is the best choice. Aho-Corasick, Shift-OR, Robin Karp but Wu Manber Algorithm is better choice because it search the pattern faster(take less time) as well as occupies less space. This paper discus the various pit falls of the wu manber algorithm with their detailed explanation. Also discuss the various improved wu manber algorithm and comparison between these algorithms.