| 
|
Quote: Boyer-Moore string matching requires roughly 3n comparisons and less than 4n comparisons
topics >
all references >
references c-d >
Topic:
pattern matching
Topic:
search algorithms
Quotation Skeleton
The problem of finding all occurrences of a … the Boyer- Moore string matching algorithm performs roughly … [less than] 4n comparisons. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: pattern matching (42 items)
Topic: search algorithms (40 items)