Speed up match algorithm

[dsoldevila]

There is a branch called optimization_try, which is an attempt to speed up the match algorithm.
Right now every genome is matched with every primer pair.
With the approach of this branch, every genome is split into chunks of n size and every chunk is matched with every primer in order to take advantage of memory locality. The matching on the forward primer is implemented (I think), but not on the reverse.