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.
No takes yet. Share an insight, caveat, or question.
Tarhio et al. (1997) studied this question.