The bad character heuristics method (also called the missed character heuristic, bad character heuristic, bad character rule, or bad character shift rule) is a rule of the Boyer-Moore Algorithm which states that, "if the first mismatch is found at position i (when scanning the pattern right to left) and T(k) is the text character that mismatches P(i), then shift the pattern right by max(1, i - R(T(k))".[1]
External Links[]
References[]
- ↑ Blumer, Anselm. "Boyer-Moore." COMP 150-GEN Genomic Sequence Algorithms. Tufts University, School of Engineering, n.d. Web. 11 Oct. 2015.