{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:27:05Z","timestamp":1772206025767,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,15]],"date-time":"2016-11-15T00:00:00Z","timestamp":1479168000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11432-015-0935-3","type":"journal-article","created":{"date-parts":[[2016,11,17]],"date-time":"2016-11-17T11:10:19Z","timestamp":1479381019000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Strict pattern matching under non-overlapping condition","\u65e0\u91cd\u53e0\u6761\u4ef6\u7684\u4e25\u683c\u6a21\u5f0f\u5339\u914d"],"prefix":"10.1007","volume":"60","author":[{"given":"Youxi","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,15]]},"reference":[{"key":"935_CR1","first-page":"2","volume":"6","author":"C Li","year":"2012","unstructured":"Li C, Yang Q Y, Wang J Y, et al. Efficient mining of gap-constrained subsequences and its various applications. ACM Trans Knowl Discov Data, 2012, 6: 2","journal-title":"ACM Trans Knowl Discov Data"},{"key":"935_CR2","first-page":"011101","volume":"58","author":"P Wang","year":"2015","unstructured":"Wang P, Xu B W, Wu Y R, et al. Link prediction in social networks: the state-of-the-art. Sci China Inf Sci, 2015, 58: 011101","journal-title":"Sci China Inf Sci"},{"key":"935_CR3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10115-014-0731-5","volume":"43","author":"J Liu","year":"2015","unstructured":"Liu J, Ma Z M, Feng X. Answering ordered tree pattern queries over fuzzy XML data. Knowl Inf Syst, 2015, 43: 473\u2013495","journal-title":"Knowl Inf Syst"},{"key":"935_CR4","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TKDE.2014.2324590","volume":"27","author":"J F Xuan","year":"2015","unstructured":"Xuan J F, Jiang H, Hu Y, et al. Towards effective bug triage with software data reduction techniques. IEEE Trans Knowl Data Eng, 2015, 27: 264\u2013280","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"935_CR5","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1109\/TSMCB.2012.2216873","volume":"43","author":"D Cook","year":"2013","unstructured":"Cook D, Krishnan N C, Rashidi P. Activity discovery and activity recognition: a new partnership. IEEE Trans Cybern, 2013, 43: 820\u2013828","journal-title":"IEEE Trans Cybern"},{"key":"935_CR6","first-page":"082308","volume":"58","author":"L N Weng","year":"2015","unstructured":"Weng L N, Zhang P, Feng Z Y, et al. Short-term link quality prediction using nonparametric time series analysis. Sci China Inf Sci, 2015, 58: 082308","journal-title":"Sci China Inf Sci"},{"key":"935_CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10115-014-0806-3","volume":"46","author":"D Rajpathak","year":"2016","unstructured":"Rajpathak D, De S. A data-and ontology-driven text mining-based construction of reliability model to analyze and predict component failures. Knowl Inf Syst, 2016, 46: 87\u2013113","journal-title":"Knowl Inf Syst"},{"key":"935_CR8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/2535933","volume":"46","author":"G Navarro","year":"2014","unstructured":"Navarro G. Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences. ACM Comput Surv, 2014, 46: 52","journal-title":"ACM Comput Surv"},{"key":"935_CR9","first-page":"052106","volume":"57","author":"H Jiang","year":"2014","unstructured":"Jiang H, Xuan J F, Ren Z L, et al. Misleading classification. Sci China Inf Sci, 2014, 57: 052106","journal-title":"Sci China Inf Sci"},{"key":"935_CR10","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1109\/TC.2012.38","volume":"62","author":"H Le","year":"2013","unstructured":"Le H, Prasanna V K. A memory-efficient and modular approach for large-scale string pattern matching. IEEE Trans Comput, 2013, 62: 844\u2013857","journal-title":"IEEE Trans Comput"},{"key":"935_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.jda.2010.09.004","volume":"11","author":"F Claude","year":"2012","unstructured":"Claude F, Navarro G, Peltola H, et al. String matching with alphabet sampling. J Discrete Algorithms, 2012, 11: 37\u201350","journal-title":"J Discrete Algorithms"},{"key":"935_CR12","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/2627692.2627706","volume":"43","author":"S Wandelt","year":"2014","unstructured":"Wandelt S, Deng D, Gerdjikov S, et al. State-of-the-art in string similarity search and join. ACM SIGMOD Rec, 2014, 43: 64\u201376","journal-title":"ACM SIGMOD Rec"},{"key":"935_CR13","first-page":"277","volume-title":"Proceedings of ACM International Conference on Management of Data","author":"Z Li","year":"2012","unstructured":"Li Z, Ge T J. Online windowed subsequence matching over probabilistic sequences. In: Proceedings of ACM International Conference on Management of Data. New York: ACM, 2012. 277\u2013288"},{"key":"935_CR14","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1093\/comjnl\/bxt023","volume":"57","author":"K-H Chen","year":"2014","unstructured":"Chen K-H, Huang G-S, Lee R C-T. Bit-parallel algorithms for exact circular string matching. Comput J, 2014, 57: 731\u2013743","journal-title":"Comput J"},{"key":"935_CR15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10115-015-0896-6","volume":"49","author":"H Hu","year":"2016","unstructured":"Hu H, Wang H Z, Li J Z, et al. An efficient pruning strategy for approximate string matching over suffix tree. Knowl Inf Syst, 2016, 49: 121\u2013141","journal-title":"Knowl Inf Syst"},{"key":"935_CR16","doi-asserted-by":"crossref","first-page":"1394","DOI":"10.1109\/TKDE.2012.48","volume":"25","author":"F F Li","year":"2013","unstructured":"Li F F, Yao B, Tang M W, et al. Spatial approximate string search. IEEE Trans Knowl Data Eng, 2013, 25: 1394\u20131409","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"935_CR17","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1007\/s11390-014-1464-3","volume":"29","author":"X D Wu","year":"2014","unstructured":"Wu X D, Qiang J P, Xie F. Pattern matching with flexible wildcards. J Comput Sci Technol, 2014, 29: 740\u2013750","journal-title":"J Comput Sci Technol"},{"key":"935_CR18","first-page":"109","volume-title":"Proceeding of IEEE International Conference on Information Reuse and Integration, Las Vegas","author":"Y X Wu","year":"2010","unstructured":"Wu Y X, Wu X D, Min F, et al. A Nettree for pattern matching with flexible wildcard constraints. In: Proceeding of IEEE International Conference on Information Reuse and Integration, Las Vegas, 2010. 109\u2013114"},{"key":"935_CR19","volume-title":"Nucleic Acids Res","author":"M D Retwitzer","year":"2015","unstructured":"Retwitzer M D, 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 Res, 2015, doi: 10.1093\/nar\/gkv435"},{"key":"935_CR20","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/978-3-319-05810-8_25","volume-title":"Proceedings of International Conference Database Systems for Advanced Applications, Bali","author":"X M Wang","year":"2014","unstructured":"Wang X M, Duan L, Dong G Z, et al. Efficient mining of density-aware distinguishing sequential patterns with gap constraints. In: Proceedings of International Conference Database Systems for Advanced Applications, Bali, 2014. 372\u2013387"},{"key":"935_CR21","doi-asserted-by":"crossref","first-page":"S7","DOI":"10.1186\/1752-0509-7-S4-S7","volume":"7","author":"V C-C Liao","year":"2013","unstructured":"Liao V C-C, Chen M-S. Efficient mining gapped sequential patterns for motifs in biological sequences. BMC Syst Biol, 2013, 7: S7","journal-title":"BMC Syst Biol"},{"key":"935_CR22","first-page":"1024","volume-title":"Proceedings of IEEE International Conference on Data Engineering, Shanghai","author":"B L Ding","year":"2009","unstructured":"Ding B L, Lo D, Han J W, et al. Efficient mining of closed repetitive gapped subsequences from a sequence database. In: Proceedings of IEEE International Conference on Data Engineering, Shanghai, 2009. 1024\u20131035"},{"key":"935_CR23","first-page":"2994","volume":"26","author":"H Yang","year":"2015","unstructured":"Yang H, Duan L, Hu B, et al. Mining top-k distinguishing sequential patterns with gap constraint. J Softw, 2015, 26: 2994\u20133009","journal-title":"J Softw"},{"key":"935_CR24","first-page":"54","volume":"9","author":"M Crochemore","year":"2002","unstructured":"Crochemore M, Iliopoulos C, Makris C, et al. Approximate string matching with gaps. Nordic J Comput, 2002, 9: 54\u201365","journal-title":"Nordic J Comput"},{"key":"935_CR25","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1142\/S0129054109007054","volume":"20","author":"D Cantone","year":"2009","unstructured":"Cantone D, Cristofaro S, Faro S. New efficient bit-parallel algorithms for the (\u03b4, \u03b1)-matching problem with applications in music information retrieval. Int J Found Comput Sci, 2009, 20: 1087\u20131108","journal-title":"Int J Found Comput Sci"},{"key":"935_CR26","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1093\/nar\/gki038","volume":"33","author":"J Cole","year":"2005","unstructured":"Cole J, Chai B, Farris R, et al. The Ribosomal Database Project (RDP-II): sequences and tools for high-throughput rRNA analysis. Nucleic Acids Res, 2005, 33: 294\u2013296","journal-title":"Nucleic Acids Res"},{"key":"935_CR27","first-page":"91","volume-title":"Proceeding of Symposium on Theory of Computing, Chicago","author":"R Cole","year":"2004","unstructured":"Cole R, Gottlieb L, Lewenstein M. Dictionary matching and indexing with errors and don\u2019t care. In: Proceeding of Symposium on Theory of Computing, Chicago, 2004. 91\u2013100"},{"key":"935_CR28","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1267066.1267068","volume":"1","author":"M H Zhang","year":"2007","unstructured":"Zhang M H, Kao B, Cheung D W, et al. Mining periodic patterns with gap requirement from sequences. ACM Trans Knowl Discov Data, 2007, 1: 7","journal-title":"ACM Trans Knowl Discov Data"},{"key":"935_CR29","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10489-013-0499-4","volume":"41","author":"Y X Wu","year":"2014","unstructured":"Wu Y X, Wang L L, Ren J D, et al. Mining sequential patterns with periodic wildcard gaps. Appl Intell, 2014, 41: 99\u2013116","journal-title":"Appl Intell"},{"key":"935_CR30","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.compbiomed.2013.02.006","volume":"43","author":"X D Wu","year":"2013","unstructured":"Wu X D, Zhu X Q, He Y, et al. PMBC: pattern mining from biological sequences with wildcard constraints. Comput Biol Med, 2013, 43: 481\u2013492","journal-title":"Comput Biol Med"},{"key":"935_CR31","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10115-015-0854-3","volume":"47","author":"A Ibrahim","year":"2016","unstructured":"Ibrahim A, Sastry S, Sastry P S. Discovering compressing serial episodes from event sequences. Knowl Inf Syst, 2016, 47: 405\u2013432","journal-title":"Knowl Inf Syst"},{"key":"935_CR32","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"H Lam","year":"2013","unstructured":"Lam H, M\u00f6rchen F, Fradkin D, et al. Mining compressing sequential patterns. Stat Anal Data Min, 2013, 7: 34\u201352","journal-title":"Stat Anal Data Min"},{"key":"935_CR33","first-page":"315","volume-title":"Proceeding of ACM International Conference on Knowledge Discovery and Data Mining, Edmonton","author":"M El-Ramly","year":"2002","unstructured":"El-Ramly M, Stroulia E, Sorenson P. From run-time behavior to usage scenarios: an interaction-pattern mining approach. In: Proceeding of ACM International Conference on Knowledge Discovery and Data Mining, Edmonton, 2002. 315\u2013324"},{"key":"935_CR34","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2012.03.029","volume":"443","author":"P Bille","year":"2012","unstructured":"Bille P, G\u00f8rtz I, Vildh\u00f8j H W, et al. String matching with variable length gaps. Theor Comput Sci, 2012, 443: 25\u201334","journal-title":"Theor Comput Sci"},{"key":"935_CR35","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/s10489-014-0612-3","volume":"42","author":"Y X Wu","year":"2015","unstructured":"Wu Y X, Fu S, Jiang H, et al. Strict approximate pattern matching with general gaps. Appl Intell, 2015, 42: 566\u2013580","journal-title":"Appl Intell"},{"key":"935_CR36","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1177\/0165551515603286","volume":"42","author":"Y X Wu","year":"2016","unstructured":"Wu Y X, Tang Z Q, Jiang H, et al. Approximate pattern matching with gap constraints. J Inf Sci, 2016, 42: 639\u2013658","journal-title":"J Inf Sci"},{"key":"935_CR37","first-page":"1096","volume":"26","author":"X Chai","year":"2015","unstructured":"Chai X, Jia X F, Wu Y X, et al. Strict pattern matching with general gaps and one-off condition (in Chinese). J Softw, 2015, 26: 1096\u20131112","journal-title":"J Softw"},{"key":"935_CR38","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10489-012-0394-4","volume":"39","author":"D Guo","year":"2013","unstructured":"Guo D, Hu X G, Xie F, et al. Pattern matching with wildcards and gap-Length constraints based on a centrality-degree graph. Appl Intell, 2013, 39: 57\u201374","journal-title":"Appl Intell"},{"key":"935_CR39","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.3724\/SP.J.1016.2011.01452","volume":"34","author":"Y X Wu","year":"2011","unstructured":"Wu Y X, Wu X D, Jiang H, et al. A heuristic algorithm for MPMGOOC. Chin J Comput, 2011, 34: 1452\u20131462","journal-title":"Chin J Comput"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-0935-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-0935-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-0935-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:49:50Z","timestamp":1498362590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-0935-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,15]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["935"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-0935-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,15]]},"article-number":"012101"}}