Expand description

ShiftAnd algorithm for pattern matching. Patterns may contain at most 64 symbols. Complexity: O(n) with text length n.

§Example

use bio::pattern_matching::shift_and;
let pattern = b"AAAA";
let text = b"ACGGCTAGAAAAGGCTAG";
let shiftand = shift_and::ShiftAnd::new(pattern);
let occ = shiftand.find_all(text).next().unwrap();
assert_eq!(occ, 8);

Structs§

  • Iterator over start positions of matches.
  • ShiftAnd algorithm.

Functions§

  • Calculate ShiftAnd masks. This function is called automatically when instantiating a new ShiftAnd for a given pattern.