In this study we introduce a different approach to the primer selection problem in the AmpliDiff [12] algorithm. Two different metrics, being the Hamming distance [2], and the Levenshtein distance [4], are used to compute sets of similar primers. This is done such that locations where mismatches between the primers and the target sequence can occur are determined by the locations of similar primers. The impact that said mismatches have on the solution set of amplicons and their respective primers is outlined. With this we show potential benefits of allowing mismatches to occur, as well as their drawbacks.