Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

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.

Affiliations

University of Malaya, Faculty of Computer Science & Information Technology

Abstract

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).
Subjects:Q Science
ID Code:1261

[1] Bacza-Yatcs, R., Gonnct, G. and Regnier, M., “Analysis of Boyer-Moore type string searching algorithms”, Proc. 1” ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pp. 328-343.

[2] Charras, C, Lecroq, T., Pehoushek, J.D., “A very fast string matching algorithm for small alphabets and long patterns”. Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, M. Farach-Colton ed., Piscataway, New Jersey, Lecture Notes in Computer Science 1448, Springer-Verlag, Berlin, 1998, pp. 55-64.

[3] Cornell University Computer Science, “CS312 Lecture 26: String search”, 2002 http://www.cs.comell.edu/courses/cs312/2002fa/lectures/lec26.htm

[4] Horspool, R., “Practical fast searching in string”. Software Practice and d Experience, Vol. 10, 1980, pp. 501-5066.

5] Reif, J., “String Matching (14)”, 1998, www.cs.duke.edu/education/courses /cpsl30/fall98/lectures/lectl4/node20.html

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.