Boyer-Moore o How to safely shifting the search window without missing possible match o Two major heuristics O Good Suffix two shift value: s1, S 2) O Bad Character (one shift value: S3) o In the searching stage, the shift value is calculated by max(min(s1, s2),$ 3)Boyer-Moore ⚫How to safely shifting the search window without missing possible match ⚫Two major heuristics Good Suffix (two shift value: s1,s2) Bad Character (one shift value: s3) In the searching stage, the shift value is calculated by max(min(s1,s2),s3)