Exact string matching algorithms are critical components in computational biology applications regarding the nucleotide or aminoacid sequences. The current paper presents a slightly modified version Boyer-Moore algorithm for string matching (in particular genomes) that has been optimized for a dual Xeon 5860. We highlight several ways to improve execution time and conclude based on our measurements that STTNI hardware instructions alongside core parallelism achieve most of the performance gain.