| 
|
QuoteRef: baezRA8_1989
topics >
all references >
ThesaHelp:
references a-b
Topic:
pattern matching
Topic:
search algorithms
Reference
Baeza-Yates, R.A., "String searching algorithms revisited", in Dehne, F., Sack, J.-R., Santoro, N. (ed.), Algorithms and Data Structures, Proceedings of WADS '89, Springer-Verlag. Google
Other Reference
Lecture Notes in Computer Science
abstract ;;Quote: average case for 2 string matching algorithms, Boyer-Moore-Horspool faster than hardware character match for most pattern lengths
abstract+;;Quote: string-matching variant combines Knuth-Morris-Pratt (fewer comparisons) and Boyer-Moore-Horspool (better in worst case and preprocessing)
86 ;;Quote: simple code for an efficient version of Boyer-Moore-Horspool string matching algorithm
ThesaHelp: references a-b (396 items)
Topic: pattern matching (42 items)
Topic: search algorithms (40 items)