Module bio::pattern_matching::myers

Myers bit-parallel approximate pattern matching algorithm. Finds all matches up to a given edit distance. The pattern has to fit into a bitvector, and is here limited to 64 symbols. Complexity: O(n)

Example

use bio::pattern_matching::myers::Myers;
use itertools::Itertools;

let text = b"ACCGTGGATGAGCGCCATAG";
let pattern = b"TGAGCGT";

let myers = Myers::new(pattern);
let occ = myers.find_all_end(text, 1).collect_vec();

assert_eq!(occ, [(13, 1), (14, 1)]);

Structs

Matches	Iterator over pairs of end positions and distance of matches.
Myers	Myers algorithm.