| 
|
QuoteRef: coleR10_1994
topics >
all references >
ThesaHelp:
references c-d
Topic:
pattern matching
Topic:
search algorithms
Reference
Cole, R., "Tight bounds on the complexity of the Boyer-Moore string matching algorithm", SIAM Journal of Computing, 23, 5, pp. 1075-1091, October 1994. Google
abstract ;;Quote: Boyer-Moore string matching requires roughly 3n comparisons and less than 4n comparisons
ThesaHelp: references c-d (337 items)
Topic: pattern matching (42 items)
Topic: search algorithms (40 items)