Page 23 - 《软件学报》2021年第11期

武优西 等:无重叠条件严格模式匹配的高效求解算法 3349

[10] Wu M, Wu X. On big wisdom. Knowledge and Information Systems, 2019,58(1):1−8.
[11] Manber U, Baeza-Yates R. An algorithm for string matching with a sequence of don’t cares. Information Processing Letters, 1991,
37(3):133−136.
[12] Lewenstein M. Indexing with gaps. In: Proc. of the Int’l Symp. on String Processing and Information Retrieval. Berlin, Heidelberg:
Springer-Verlag, 2011. 135−143.
[13] Navarro G, Raffinot M. Fast and simple character classes and bounded gaps pattern matching, with applications to protein
searching. Journal of Computational Biology, 2003,10(6):903−923.
[14] Drory Retwitzer M, Polishchuk M, Churkin E, et al. RNAPattMatch: A Web server for RNA sequence/structure motif detection
based on pattern matching with flexible gaps. Nucleic Acids Research, 2015,43(W1):W507−W512.
[15] Cole R, Gottlieb LA, Lewenstein M. Dictionary matching and indexing with errors and don’t cares. In: Proc. of the 36th Annual
ACM Symp. on Theory of Computing. ACM, 2004. 91−100.
[16] Song W, Liu Y, Li J. Mining high utility itemsets by dynamically pruning the tree structure. Applied Intelligence, 2014,40(1):
29−43.
[17] Zhou ZY, Pi DC. Minimal rare pattern mining method for satellite telemetry data streams. Chinese Journal of Computers, 2019,
42(6):1351−1366 (in Chinese with English abstract).
[18] Zhang M, Kao B, Cheung D, et al. Mining periodic patterns with gap requirement from sequences. ACM Trans. on Knowledge
Discovery from Data, 2007,1(2):Article No.7.
[19] Wu Y, Wang Y, Liu J, et al. Mining distinguishing subsequence patterns with nonoverlapping condition. Cluster Computing, 2019,
22(3):5905−5917.
[20] Wang L, Wang S, Liu SL, et al. An algorithm of mining sequential pattern with wildcards based on index-tree. Chinese Journal of
Computers, 2019,42(3):554−565 (in Chinese with English abstract).
[21] Wu Y, Zhu C, Li Y, et al. NetNCSP: Nonoverlapping closed sequential pattern mining. Knowledge-based Systems, 2020,196:
Article No.105812.
[22] Min F, Zhang Z, Zhai W, et al. Frequent pattern discovery with tri-partition alphabets. Information Sciences, 2020,507:715−732.
[23] Shi Q, Shan J, Yan W, et al. NetNPG: Nonoverlapping pattern matching with general gap constraints. Applied Intelligence, 2020,
50(6):1832−1845.
[24] Ding B, Lo D, Han J, et al. Efficient mining of closed repetitive gapped subsequences from a sequence database. In: Proc. of the
IEEE 25th Int’l Conf. on Data Engineering. Shanghai: IEEE, 2009. 1024−1035.
[25] Wu Y, Shen C, Jiang H, et al. Strict pattern matching under non-overlapping condition. Science China Information Sciences, 2017,
60(1):Article No.012101.
[26] Wu Y, Tong Y, Zhu X, et al. NOSEP: Nonoverlapping sequence pattern mining with gap constraints. IEEE Trans. on Cybernetics,
2018,48(10):2809−2822.
[27] Wu YX, Liu YW, Guo L, et al. Subnettrees for strict pattern matching with general gaps and length constraints. Ruan Jian Xue
Bao/Journal of Software, 2013,24(5):915−932 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4381.htm [doi:
10.3724/SP.J.1001.2013.04381]
[28] Chai X, Jia XF, Wu YX, et al. Strict pattern matching with general gaps and one-off condition. Ruan Jian Xue Bao/Journal of
Software, 2015,26(5):1096−1112 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4707.htm [doi: 10.13328/j.
cnki.jos.004707]
[29] Chen G, Wu X, Zhu X, et al. Efficient string matching with wildcards and length constraints. Knowledge and Information Systems,
2006,10(4):399−419.
[30] Fredriksson K, Grabowski S. Efficient algorithms for pattern matching with general gaps, character classes, and transposition
invariance. Information Retrieval, 2008,11(4):335−357.
[31] Han C, Duan L, Lin Z, et al. Discovering relationship patterns among associated temporal event sequences. In: Proc. of the Int’l
Conf. on Database Systems for Advanced Applications. Cham: Springer-Verlag, 2019. 107−123.
[32] Wu Y, Fu S, Jiang H, et al. Strict approximate pattern matching with general gaps. Applied Intelligence, 2015,42(3):566−580.
[33] Yang H, Duan L, Hu B, et al. Mining top-k distinguishing sequential patterns with gap constraint. Ruan Jian Xue Bao/Journal of
Software, 2015,26(11):2994−3009 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4906.htm [doi: 10.13328/j.
cnki.jos.004906]