| 
|
QuoteRef: crocM10_1994
topics >
all references >
ThesaHelp:
references c-d
Topic:
search algorithms
Reference
Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., "Speeding up two string-matching algorithms", Algorithmica, 12, 4-5, pp. 247-267, October-November 1994. Google
abstract ;;Quote: speed up the Boyer-Moore and reverse factor algorithms by remembering the last matched segment; for binary alphabets Turbo_RF is fastest
ThesaHelp: references c-d (337 items)
Topic: search algorithms (40 items)