String Matching in the DNA Alphabet
Jorma Tarhio, Hannu Peltola · Software Practice and Experience · 1997
Searching for long DNA strings is studied. A q-gram variation of the Boyer–Moore algorithm is considered. An alphabet transformation with precomputed tables is utilized to reduce the processing time. Experimental results show that the new algorithm is efficient in practice. © 1997 John Wiley & Sons, Ltd.