Function needletail::sequence::minimizer

pub fn minimizer(seq: &[u8], length: usize) -> Cow<[u8]>

Find the lexigraphically smallest substring of seq of length length

There's probably a faster algorithm for this somewhere...