Analysis of Boyer-Moore-Horspool String-Matching Heuristic

Random Structures and Algorithms

Volumn 10, Issue 1-2, 1997, Pages 169-186

  Mahmoud, Hosam M ^a   Smythe, Robert T ^a   Régnier, Mireille ^b  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

^b INRIA   (France)

Author keywords

Analysis of algorithms; Central limit theorem; String matching

Indexed keywords

EID: 0031537894     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199701/03)10:1/2<169::aid-rsa9>3.0.co;2-t     Document Type: Article

References (4)

1. R. Baeza-Yates and M. Régnier, Average running time of the BMH heuristic, Theor. Comput. Sci., 92, 19-31, (1992).
2. R. Baeza-Yates, G. Gonnet, and M. Régnier, Analysis of Boyer-Moore type string searching algorithms, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pp. 328-343.
3. P. Billingsley, Probability and Measure, Wiley, New York, 1986.
4. R. Horspool, Practical fast searching in strings, Softw. Practice Experience, 10, 501-506 (1980).