[1]CHANG Y I, CHEN J R, HSU M T. A Hash Trie filter method for approximate string matching in genomic databases[J]. Applied Intelligence, 2010, 33(1):21-38.[2]BHUKYA R, SOMAYAJULU D V L N. 2-jump DNA search multiple pattern matching algorithm[J]. International Journal of Computer Science Issues, 2011, 8(3):320-329.[3]龚才春, 黄玉兰, 许洪波,等. 基于多重索引模型的大规模词典近似匹配算法[J]. 计算机研究与发展, 2008, 45(10):1776-1781.[4]范立新. 改进的中文近似字符串匹配算法[J]. 计算机工程与应用, 2006,42(34):172-207.[5]樊爱京, 杨照峰. 用于网络入侵检测的模式匹配新方法[J]. 计算机应用, 2011, 31(11):2961-2985.[6]QU Z Y, HUANG X B. The improving pattern matching algorithm of intrusion detection[C]// 2011 International Conference on Advanced in Control Engineering and Information Science. Oxford: Elsevier, 2011:2841-2846.[7]ALTSCHUL S F, BOGUSKI M S, FISH W, et al. Issues in searching molecular sequence databases[J]. Nature Genetics, 1994(6): 119-128.[8]WU S, MANBER U, MYERS E W. A subquadratic algorithm for approximate limited expression matching[J]. Algorithmica, 1996,15(1):50-67.[9]NAVARRO G. Regular expression searching over Ziv-Lempel compressed text[C]// Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching. Berlin: Springer, 2001:1-17.[10]FISCHER M J, PATERSON M S. String matching and other products[C]// Proceedings of the 7th SIAM-AMS Complexity of Computation. New York: American Mathematical Society, 1974:113-125.[11]CHEN G, WU X D, ZHU X Q, et al. Efficient string matching with wildcards and length constraints[J]. Knowledge and Information Systems, 2006, 10(4):399-419.[12]HE D, WU X D, ZHU X Q. SAIL-APPROX: an efficient on-line algorithm for approximate pattern matching with wildcards and length constraints[C]// IEEE International Conference on Bioinformatics and Biomedicine. Washington, DC: IEEE Computer Society, 2007: 151-158.[13]HUANG Y M, WU X D, HU X G, et al. Mining frequent patterns and one-off condition[C]// Proceedings of the 12th IEEE International Conference on Computational Science and Engineering. Washington, DC: IEEE Computer Society, 2009: 180-186. |