Crochemore-Perrin algorithm using SSE instructions

Modification of Two-Way for packed string matching. It is based on two specialized packed string instructions.

Appeared in:

• [13]: Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R., Weimann, O.: Optimal packed string matching. In: Chakraborty, S., Kumar, A. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India. LIPIcs, Exact Online String Matching Bibliography 17 vol. 13, pp. 423–432. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011), http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.423 ↗
• [14]: Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R., Weimann, O.: Towards optimal packed string matching. Theor. Comput. Sci. 525, 111–129 (2014), http://dx.doi.org/10.1016/j.tcs.2013.06.013 ↗