【参考文献】
【Dan1997】Dan Gusfield ,Algorithms on Strings, Trees and Sequences: Computer Science and computational Biology ,University of California Press ,CA ,1997
【AC1975】 Aho, A. V., and M. J. Corasick, ''Efficient string matching: an aid to bibliographic search,''Communications of the ACM 18 (June 1975), pp. 333-340.
【CW1979】Commentz-Walter, B, ''A string matching algorithm fast on the average,'' Proc. 6th International Colloquium on Automata, Languages, and Programming (1979), pp. 118-132.
【SumWu1994】Sun Wu,“A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING”,Technical Report Department of Computer Science Chung-Cheng University Chia-Yi, Taiwan sw@cs.ccu.edu.tw
【SumKim1999】Sun Kim ,A new string-pattern matching algorithm using partitioning and hashing efficiently , The ACM Journal of Experimental Algorithmics (JEA) Volume 4 , (July 1999), http://www.jea.acm.org/volume4.html
【Navarro2000】Gonzalo Navarro, Mathieu Raffinot , Fast and flexible string matching by combining bit-parallelism and suffix automata, The ACM Journal of Experimental Algorithmics (JEA) Volume 5 , (August 2000), http://www.jea.acm.org/volume5.html