Applying Bi-Directional Search Strategy in Selected String Matching Algorithms
| Autor: | Grishma Pandey, Gend Lal Prajapati, Morris Pratt Algorithm |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
High Energy Physics::Theory
Theoretical computer science Computer science law 0202 electrical engineering electronic engineering information engineering 020206 networking & telecommunications 020201 artificial intelligence & image processing 02 engineering and technology String searching algorithm Boyer–Moore string search algorithm Rabin–Karp algorithm law.invention |
| Zdroj: | International Journal of Computer Applications. 143:40-43 |
| ISSN: | 0975-8887 |
| DOI: | 10.5120/ijca2016910474 |
| Popis: | String matching is an important problem in computer science having several practical applications. In this paper, we apply bi-directional searching mechanism in exact string matching algorithms: Boyer Moore, Brute Force, KnuthMorris Pratt, and Rabin Karp. Experiments show that this strategy leads to better efficiency of these string matching algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|