A Survey Paper on String Matching |
Author(s): |
| Minal Suthar , Samarth campus, Himmatnagar ; Amit Patel, Samarth campus, Himmatnagar ; Shivali Shah, Samarth campus, Himmatnagar |
Keywords: |
| String Matching, Naïve Algorithm |
Abstract |
|
String matching is a valuable problem in computer science. String matching is the problem of finding all occurrences of a pattern within a text. String matching algorithms are used to display the search result, when we do search for a string in any notepad-word pad file, browser or database. This paper provides an overview of different string matching algorithms, such as Naive algorithm, Rabin-Karp algorithm, Boyer-Moore algorithm, Knuth-Morris-Pratt algorithm. |
Other Details |
|
Paper ID: IJSRDV3I50415 Published in: Volume : 3, Issue : 5 Publication Date: 01/08/2015 Page(s): 1352-1354 |
Article Preview |
|
|
|
|
