Skip to content

Boyer-Moore-Horspool with q-grams

Improvement of Horspool using a super alphabet. It computes the occurrence heuristics reading q-grams in a single operation.

Appeared in:

  • [72]: Kalsi, P., Peltola, H., Tarhio, J.: Comparison of exact string matching algorithms for biological sequences. In: Elloumi, M., K¨ung, J., Linial, M., Murphy, R.F., Schneider, K., Toma, C. (eds.) Bioinformatics Research and Development, Second International Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008, Proceedings. Communications in Computer and Information Science, vol. 13, pp. 417–426. Springer (2008),