A Study and Synthesis of Sliding Window Mechanism in String Pattern Matching Algorithms: Boyer Moore Vs. Horspool
Lip Yee Por, and Miss Laiha Mat Kiah, (2004) A Study and Synthesis of Sliding Window Mechanism in String Pattern Matching Algorithms: Boyer Moore Vs. Horspool. In: Proceedings of the Joint Conference on Informatics and Research on Women in ICT (RWICT) 2004 , 28 - 30 July 2004 , Putra World Trade Center, Kuala Lumpur, Malaysia .
Full text not available from this repository.
University of Malaya, Faculty of Computer Science & Information Technology
In this paper, the fastest algorithm among Boyer Moore and Horspool Algorithms has been obtained. However, before the fastest algorithm can be determined, studies and analysis of both algorithms are required. At the fundamental stage, all the matching mechanisms as well as the shifting methodologies of both algorithms have been studied. After comprehending each algorithm, an in depth analysis with various premeditated cases are applied in order to test these algorithms. Factors are deliberated before the fastest string matching algorithm is obtained. Finally, a fair conclusion has been provided at the end of this paper.
|Item Type:||Conference or Workshop Item (Paper)|
|Keywords:||Algorithm, String, Pattern, Boyer Moore (BM), Horspool (H).
Repository Staff Only: item control page