1. Clifford P, Clifford R. Simple deterministic wildcard matching [J]. Inf Process Lett, 2007, 101(2): 53–54.
2. Fischer M, Paterson M. String matching and other products [C] // Proceedings of the 7th SIAMAMS Complexity of Computation. Providence:SIAM, 1974: 113–125.
3. Baeza-Yates R A, Gonnet G H. A new approach to text searching [J]. Communications of the ACM, 1992, 35(10): 74–82.
4. Indyk P. Faster algorithms for string matching problems: Matching the convolution bound [C] // Proceedings of the 38th Annual Symposium on Foundations of Computer Science. Washington D C: IEEE Press, 1998: 166–173.
5. Cole R, Hariharan R. Verifying candidate matches in sparse and wildcard matching [J] // 7th Proceedings of the Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2002:592–601.