Searching for a set of correlated patterns

Aho, 1975, Efficient string matching: An aid to bibliographic search, Communications of the ACM, 18, 333, 10.1145/360825.360855

A. Amir, G. Benson, M. Farach, Alphabet-independent two dimensional matching, in: Proceedings, 24th Annual ACM Symposium on the Theory of Computation (STOC), 1992, pp. 59–68

Boyer, 1977, A fast string searching algorithm, Communications of the ACM, 20, 762, 10.1145/359842.359859

Crochemore, 1999, Fast practical multi-pattern matching, Information Processing Letters, 71, 107, 10.1016/S0020-0190(99)00092-7

R. Grossi, G.F. Italiano, Suffix trees and their applications in string algorithms, in: Proc. 1st South American Workshop on String Processing (WSP 1993), September 1993, pp. 57–76

Knuth, 1977, Fast pattern matching in strings, SIAM Journal of Computing, 6, 323, 10.1137/0206024

Hui, 1992, Color set size problem with applications to string matching, vol. 644, 230

Just, 2001, Computational complexity of multiple sequence alignment with SP-score, Journal of Computational Biology, 8, 615, 10.1089/106652701753307511

Schieber, 1988, On finding lowest common ancestors: simplification and parallelization, SIAM Journal of Computing, 17, 1253, 10.1137/0217079

Uratani, 1993, A fast string-searching algorithm for multiple patterns, Information Processing and Management, 6, 775, 10.1016/0306-4573(93)90106-N