Fast searching in packed strings

Aho, 1975, Efficient string matching: an aid to bibliographic search, Commun. ACM, 18, 333, 10.1145/360825.360855 A. Amir, G. Benson, Efficient two-dimensional compressed matching, in: Proceedings of the 2nd Data Compression Conference, 1992, pp. 279–288. A. Amir, G. Benson, Two-dimensional periodicity and its applications, in: Proceedings of the 3rd Annual ACM–SIAM Symposium on Discrete Algorithms, 1992, pp. 440–452. Amir, 1996, Let sleeping files lie: pattern matching in Z-compressed files, J. Comput. System Sci., 52, 299, 10.1006/jcss.1996.0023 Arlazarov, 1970, On economic construction of the transitive closure of a directed graph, Dokl. Acad. Nauk, 194, 487 R.A. Baeza-Yates, Efficient text searching, PhD thesis, Dept. of Computer Science, University of Waterloo, 1989. Baeza-Yates, 1989, Improved string searching, Softw. Pract. Exp., 19, 257, 10.1002/spe.4380190305 Baeza-Yates, 1992, A new approach to text searching, Commun. ACM, 35, 74, 10.1145/135239.135243 Bille, 2009, Faster regular expression matching, vol. 5555, 171 Boyer, 1977, A fast string searching algorithm, Commun. ACM, 20, 762, 10.1145/359842.359859 Faro, 2009, An efficient matching algorithm for encoded DNA sequences and binary strings, vol. 5577, 106 S. Faro, T. Lecroq, Efficient pattern matching on binary strings, in: Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science, 2009. Fredriksson, 2002, Faster string matching with super-alphabets, vol. 2476, 44 Fredriksson, 2003, Shift-or string matching with super-alphabets, Inf. Process. Lett., 87, 201, 10.1016/S0020-0190(03)00296-5 Gusfield, 1997 Karp, 1987, Efficient randomized pattern-matching algorithms, IBM J. Res. Dev., 31, 249, 10.1147/rd.312.0249 Klein, 2007, Accelerating Boyer Moore searches on binary texts, vol. 4783, 130 Knuth, 1977, Fast pattern matching in strings, SIAM J. Comput., 6, 323, 10.1137/0206024 Masek, 1980, A faster algorithm for computing string edit distances, J. Comput. System Sci., 20, 18, 10.1016/0022-0000(80)90002-1 J. Morris, R.V. Pratt, A linear pattern matching algorithm, Technical Report 40, Univ. of California, Berkeley, 1970. Myers, 1992, A four-Russians algorithm for regular expression pattern matching, J. ACM, 39, 430, 10.1145/128749.128755 Navarro, 2002 Rytter, 1999, Algorithms on compressed strings and arrays, vol. 1725, 48 Tarhio, 1997, String matching in the DNA alphabet, Softw. Pract. Exp., 27, 851, 10.1002/(SICI)1097-024X(199707)27:7<851::AID-SPE108>3.0.CO;2-D Thompson, 1968, Regular expression search algorithm, Commun. ACM, 11, 419, 10.1145/363347.363387 Welch, 1984, A technique for high-performance data compression, IEEE Computer, 17, 8, 10.1109/MC.1984.1659158 Wu, 1995, A subquadratic algorithm for approximate regular expression matching, J. Algorithms, 19, 346, 10.1006/jagm.1995.1041