| 
|
QuoteRef: fenwP7_2001
topics >
all references >
ThesaHelp:
references e-f
Topic:
search algorithms
Reference
Fenwick, P., "Fast string matching for multiple searches", Software--Practice and Experience, 31, 9, pp. 815-833, July 25, 2001. Google
abstract ;;Quote: use diagrams, filters, and preprocessing for fast, frequent searches; much faster with initialization overhead of 5-10 conventional searches
817 ;;Quote: back-tracking is rarely a problem so KMP search is similar to naive search for most files
ThesaHelp: references e-f (168 items)
Topic: search algorithms (40 items)