{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T04:06:31Z","timestamp":1771992391125,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["917446209"],"award-info":[{"award-number":["917446209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10489-020-01778-1","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:27:14Z","timestamp":1594340834000},"page":"4094-4116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["NetDAP: (\u03b4, \u03b3) \u2212approximate pattern matching with length constraints"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinquan","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Guo","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":[[2020,7,10]]},"reference":[{"issue":"1","key":"1778_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3369935","volume":"12","author":"H Fernau","year":"2020","unstructured":"Fernau H, Manea F, Merca\u015f R, Schmid ML (2020) Pattern matching with variables: efficient algorithms and complexity results. ACM Transactions on Computation Theory (TOCT) 12(1):1\u201337","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"issue":"13","key":"1778_CR2","doi-asserted-by":"crossref","first-page":"16833","DOI":"10.1007\/s11042-017-5256-y","volume":"77","author":"M Sotoodeh","year":"2018","unstructured":"Sotoodeh M, Tajeripour F, Teimori S, Jorgensen K (2018) A music symbols recognition method using pattern matching along with integrated projection and morphological operation techniques. Multimed Tools Appl 77(13):16833\u201316866","journal-title":"Multimed Tools Appl"},{"issue":"4","key":"1778_CR3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/2535933","volume":"46","author":"G Navarro","year":"2014","unstructured":"Navarro G (2014) Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences. ACM Computing Surveys (CSUR) 46(4):52","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"2","key":"1778_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s41019-019-0094-8","volume":"4","author":"X Chen","year":"2019","unstructured":"Chen X, Rao Y, Xie H, Wang FL, Zhao Y, Yin J (2019) Sentiment classification using negative and intensive sentiment supplement information. Data Sci Eng 4(2):109\u2013118","journal-title":"Data Sci Eng"},{"issue":"4","key":"1778_CR5","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1109\/TKDE.2014.2349914","volume":"27","author":"H Hu","year":"2014","unstructured":"Hu H, Zheng K, Wang X, Zhou A (2014) GFIlter: a general gram filter for string similarity search. IEEE Trans Knowl Data Eng 27(4):1005\u20131018","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1778_CR6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.comcom.2019.06.011","volume":"145","author":"M Aldwairi","year":"2019","unstructured":"Aldwairi M, Hamzah AY, Jarrah M (2019) MultiPLZW: a novel multiple pattern matching search in LZW-compressed data. Comput Commun 145:126\u2013136","journal-title":"Comput Commun"},{"key":"1778_CR7","first-page":"551","volume":"2016","author":"B Choi","year":"2016","unstructured":"Choi B, Chae J, Jamshed M, Park K, Han D (2016) DFC: accelerating string pattern matching for network applications. USENIX Symposium on Networked Systems Design and Implementation 2016:551\u2013565","journal-title":"USENIX Symposium on Networked Systems Design and Implementation"},{"issue":"2","key":"1778_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3106164","volume":"18","author":"H Jiang","year":"2018","unstructured":"Jiang H, Chen X, He T, Chen Z, Li X (2018) Fuzzy clustering of crowdsourced test reports for apps. ACM Transactions on Internet Technology (TOIT) 18(2):1\u201328","journal-title":"ACM Transactions on Internet Technology (TOIT)"},{"issue":"5","key":"1778_CR9","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1109\/TC.2012.38","volume":"62","author":"H Le","year":"2012","unstructured":"Le H, Prasanna VK (2012) A memory-efficient and modular approach for large-scale string pattern matching. IEEE Trans Comput 62(5):844\u2013857","journal-title":"IEEE Trans Comput"},{"key":"1778_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.jbi.2016.12.010","volume":"66","author":"S Ghosh","year":"2017","unstructured":"Ghosh S, Li J, Cao L, Ramamohanarao K (2017) Septic shock prediction for ICU patients via coupled HMM walking on sequential contrast patterns. J Biomed Inform 66:19\u201331","journal-title":"J Biomed Inform"},{"issue":"1","key":"1778_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TKDE.2013.109","volume":"26","author":"X Wu","year":"2014","unstructured":"Wu X, Zhu X, Wu GQ, Ding W (2014) Data mining with big data. IEEE Trans Knowl Data Eng 26(1):97\u2013107","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1778_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","volume":"40","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J (2014) Mining high utility itemsets by dynamically pruning the tree structure. Appl Intell 40(1):29\u201343","journal-title":"Appl Intell"},{"issue":"1","key":"1778_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-018-1282-y","volume":"58","author":"M Wu","year":"2019","unstructured":"Wu M, Wu X (2019) On big wisdom. Knowledge and Information Systems 58(1):1\u20138","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"1778_CR14","first-page":"39","volume":"12","author":"P Bille","year":"2016","unstructured":"Bille P, Fischer J, G\u00f8rtz IL, Kopelowitz T, Sach B, Vildh\u00f8j HW (2016) Sparse text indexing in small space. ACM Transactions on Algorithms (TALG) 12(3):39","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"1778_CR15","doi-asserted-by":"publisher","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Yu SP (2019) HUOPM: high-utility occupancy pattern mining. IEEE Transactions on Cybernetics. https:\/\/doi.org\/10.1109\/TCYB.2019.2896267","DOI":"10.1109\/TCYB.2019.2896267"},{"issue":"9","key":"1778_CR16","doi-asserted-by":"crossref","first-page":"2764","DOI":"10.1109\/TNNLS.2018.2886199","volume":"30","author":"X Dong","year":"2019","unstructured":"Dong X, Qiu P, Lu J, Cao L (2019) Mining top-k useful negative sequential patterns via learning. IEEE Transactions on Neural Networks and Learning Systems 30(9):2764\u20132778","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"1778_CR17","doi-asserted-by":"publisher","unstructured":"Belhadi A, Djenouri Y, Lin JCW, Cano A (2020) A general-purpose distributed pattern mining system. Applied Intelligence. https:\/\/doi.org\/10.1007\/s10489-020-01664-w","DOI":"10.1007\/s10489-020-01664-w"},{"issue":"4","key":"1778_CR18","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1007\/s10489-017-0949-5","volume":"47","author":"L Bai","year":"2017","unstructured":"Bai L, Li Y, Liu J (2017) FSPTWigfast: holistic twig query on fuzzy spatiotemporal XML data. Appl Intell 47(4):1224\u20131239","journal-title":"Appl Intell"},{"issue":"4","key":"1778_CR19","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1007\/s10489-017-1050-9","volume":"48","author":"M Bouakkaz","year":"2018","unstructured":"Bouakkaz M, Ouinten Y, Loudcher S, Fournier-Viger P (2018) Efficiently mining frequent itemsets applied for textual aggregation. Appl Intell 48(4):1013\u20131019","journal-title":"Appl Intell"},{"issue":"5","key":"1778_CR20","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1177\/0165551515603286","volume":"42","author":"Y Wu","year":"2016","unstructured":"Wu Y, Tang Z, Jiang H, Wu X (2016) Approximate pattern matching with gap constraints. J Inf Sci 42(5):639\u2013658","journal-title":"J Inf Sci"},{"key":"1778_CR21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.tcs.2015.12.027","volume":"654","author":"K Nip","year":"2016","unstructured":"Nip K, Wang Z, Xing W (2016) A study on several combination problems of classic shop scheduling and shortest path. Theor Comput Sci 654:175\u2013187","journal-title":"Theor Comput Sci"},{"issue":"W1","key":"1778_CR22","doi-asserted-by":"crossref","first-page":"W507","DOI":"10.1093\/nar\/gkv435","volume":"43","author":"M Drory Retwitzer","year":"2015","unstructured":"Drory Retwitzer M, Polishchuk M, Churkin E, Kifer L, Yakhini Z, Barash D (2015) RNAPAttmatch: a web server for RNA sequence\/structure motif detection based on pattern matching with flexible gaps. Nucleic Acids Res 43(W1):W507\u2013W512","journal-title":"Nucleic Acids Res"},{"key":"1778_CR23","doi-asserted-by":"crossref","first-page":"4922","DOI":"10.1109\/ACCESS.2016.2593953","volume":"4","author":"CD Tan","year":"2016","unstructured":"Tan CD, Min F, Wang M, Zhang HR, Zhang ZH (2016) Discovering patterns with weak-wildcard gaps. IEEE Access 4:4922\u20134932","journal-title":"IEEE Access"},{"issue":"4","key":"1778_CR24","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10489-013-0426-8","volume":"39","author":"SJ Yen","year":"2013","unstructured":"Yen SJ, Lee YS (2013) Mining non-redundant time-gap sequential patterns. Appl Intell 39 (4):727\u2013738","journal-title":"Appl Intell"},{"issue":"1","key":"1778_CR25","first-page":"2","volume":"6","author":"C Li","year":"2012","unstructured":"Li C, Yang Q, Wang J, Li M (2012) Efficient mining of gap-constrained subsequences and its various applications. ACM Transactions on Knowledge Discovery from Data (TKDD) 6(1):2","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"3","key":"1778_CR26","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/s10489-014-0612-3","volume":"42","author":"Y Wu","year":"2015","unstructured":"Wu Y, Fu S, Jiang H, Wu X (2015) Strict approximate pattern matching with general gaps. Appl Intell 42(3):566\u2013580","journal-title":"Appl Intell"},{"issue":"11","key":"1778_CR27","first-page":"2994","volume":"26","author":"H Yang","year":"2015","unstructured":"Yang H, Duan L, Hu B, Deng S, Wang W, Qin P (2015) Mining top-k distinguishing sequential patterns with gap constraint. Journal of Software 26(11):2994\u20133009","journal-title":"Journal of Software"},{"issue":"10","key":"1778_CR28","first-page":"1979","volume":"39","author":"HF Wang","year":"2016","unstructured":"Wang HF, Duan L, Zuo J, Wang W, Li Z, Tang C (2016) Efficient mining of distinguishing sequential patterns without a predefined gap constraint. Chinese Journal of Computers 39(10):1979\u2013 1991","journal-title":"Chinese Journal of Computers"},{"issue":"5","key":"1778_CR29","doi-asserted-by":"crossref","first-page":"915","DOI":"10.3724\/SP.J.1001.2013.04381","volume":"24","author":"Y Wu","year":"2013","unstructured":"Wu Y, Liu Y, Guo L, Wu X (2013) Subnettrees for strict pattern matching with general gaps and length constraints. Journal of Software 24(5):915\u2013932","journal-title":"Journal of Software"},{"key":"1778_CR30","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-642-20662-7_7","volume":"2011","author":"T Haapasalo","year":"2011","unstructured":"Haapasalo T, Silvasti P, Sippu S, Soisalon-Soininen E (2011) Online dictionary matching with variable-length gaps. International Symposium on Experimental Algorithms 2011:76\u201387","journal-title":"International Symposium on Experimental Algorithms"},{"key":"1778_CR31","doi-asserted-by":"publisher","unstructured":"Shi Q, Shan J, Yan W, Wu Y, Wu X (2020) NetNPG: nonoverlapping pattern matching with general gap constraints. Applied Intelligence. https:\/\/doi.org\/10.1007\/s10489-019-01616-z","DOI":"10.1007\/s10489-019-01616-z"},{"key":"1778_CR32","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-642-37064-9_46","volume":"2013","author":"S Sippu","year":"2013","unstructured":"Sippu S, Soisalon-Soininen E (2013) Online matching of multiple regular patterns with gaps and character classes. International Conference on Language and Automata Theory and Applications 2013:523\u2013534","journal-title":"International Conference on Language and Automata Theory and Applications"},{"issue":"1","key":"1778_CR33","doi-asserted-by":"crossref","first-page":"012101","DOI":"10.1007\/s11432-015-0935-3","volume":"60","author":"Y Wu","year":"2017","unstructured":"Wu Y, Shen C, Jiang H, Wu X (2017) Strict pattern matching under non-overlapping condition. Science China Information Sciences 60(1):012101","journal-title":"Science China Information Sciences"},{"issue":"1","key":"1778_CR34","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, Li J, Gao H (2016) An efficient pruning strategy for approximate string matching over suffix tree. Knowl Inf Syst 49(1):121\u2013141","journal-title":"Knowl Inf Syst"},{"key":"1778_CR35","doi-asserted-by":"crossref","first-page":"24350","DOI":"10.1109\/ACCESS.2018.2832209","volume":"6","author":"Y Wu","year":"2018","unstructured":"Wu Y, Li S, Liu J, Wu X (2018) NETASPNO: approximate Strict pattern matching under nonoverlapping condition. IEEE Access 6:24350\u201324361","journal-title":"IEEE Access"},{"key":"1778_CR36","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.ipl.2018.07.006","volume":"139","author":"AN Arslan","year":"2018","unstructured":"Arslan AN (2018) A fast algorithm for all-pairs Hamming distances. Inf Process Lett 139:49\u201352","journal-title":"Inf Process Lett"},{"key":"1778_CR37","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 IL, Vildh\u00f8j HW, Wind DK (2012) String matching with variable length gaps. Theoretical Computer Science 443:25\u201334","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1778_CR38","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10489-013-0499-4","volume":"41","author":"Y Wu","year":"2014","unstructured":"Wu Y, Wang L, Ren J, Ding W, Wu X (2014) Mining sequential patterns with periodic wildcard gaps. Appl Intell 41(1):99\u2013 116","journal-title":"Appl Intell"},{"key":"1778_CR39","doi-asserted-by":"crossref","unstructured":"Wang X, Duan L, Dong G, Ye Z, Tang C (2014) Efficient mining of density-aware distinguishing sequential patterns with gap constraints. In: International conference on database systems for advanced applications. Springer, Cham, pp 372\u2013387","DOI":"10.1007\/978-3-319-05810-8_25"},{"issue":"3","key":"1778_CR40","doi-asserted-by":"crossref","first-page":"1550032","DOI":"10.1142\/S1793830915500329","volume":"7","author":"AN Arslan","year":"2015","unstructured":"Arslan AN, George B, Stor K (2015) New algorithms for pattern matching with wildcards and length constraints. Discrete Mathematics, Algorithms and Applications 7(3):1550032","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"issue":"4","key":"1778_CR41","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1007\/s10044-018-0733-0","volume":"21","author":"N Liu","year":"2018","unstructured":"Liu N, Xie F, Wu X (2018) Multi-pattern matching with variable-length wildcards using suffix tree. Pattern Anal Applic 21(4):1151\u20131165","journal-title":"Pattern Anal Applic"},{"issue":"3","key":"1778_CR42","doi-asserted-by":"crossref","first-page":"5905","DOI":"10.1007\/s10586-017-1671-0","volume":"22","author":"Y Wu","year":"2019","unstructured":"Wu Y, Wang Y, Liu J, Yu M, Liu J, Li Y (2019) Mining distinguishing subsequence patterns with nonoverlapping condition. Clust Comput 22(3):5905\u20135917","journal-title":"Clust Comput"},{"issue":"4","key":"1778_CR43","doi-asserted-by":"crossref","first-page":"829","DOI":"10.3233\/IDA-173435","volume":"22","author":"H Liu","year":"2018","unstructured":"Liu H, Wang L, Liu Z, Zhao P, Wu X (2018) Efficient pattern matching with periodical wildcards in uncertain sequences. Intelligent Data Analysis 22(4):829\u2013842","journal-title":"Intelligent Data Analysis"},{"key":"1778_CR44","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.tcs.2013.10.006","volume":"525","author":"J Kim","year":"2014","unstructured":"Kim J, Eades P, Fleischer R, Hong S, Iliopoulos CS, Park K, Puglisi SJ, Tokuyama T (2014) Order-preserving matching. Theor Comput Sci 525:68\u201379","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1778_CR45","first-page":"54","volume":"9","author":"M Crochemore","year":"2002","unstructured":"Crochemore M, Iliopoulos CS, Makris C, Rytter W, Tsakalidis AK, Tsichlas T (2002) Approximate string matching with gaps. Nordic Journal of Computing 9(1):54\u201365","journal-title":"Nordic Journal of Computing"},{"issue":"6","key":"1778_CR46","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G Navarro","year":"2013","unstructured":"Navarro G, Raffinot M (2013) Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. J Comput Biol 10(6):903\u201323","journal-title":"J Comput Biol"},{"key":"1778_CR47","doi-asserted-by":"publisher","unstructured":"Dong X, Gong Y, Cao L (2018) e-RNSP: an efficient method for mining repetition negative sequential patterns. IEEE Transactions on Cybernetics. https:\/\/doi.org\/10.1109\/TCYB.2018.2869907","DOI":"10.1109\/TCYB.2018.2869907"},{"key":"1778_CR48","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.patrec.2018.01.013","volume":"109","author":"R Wang","year":"2018","unstructured":"Wang R, Ji W, Liu M, Wang X, Weng J, Deng S, Gao SY, Yuan C (2018) Review on mining data from multiple data sources. Pattern Recogn Lett 109:120\u2013128","journal-title":"Pattern Recogn Lett"},{"issue":"2","key":"1778_CR49","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/s10489-018-1280-5","volume":"49","author":"T Le","year":"2019","unstructured":"Le T, Vo B, Fournier-Viger P, Lee MY, Baik SW (2019) SPPC: a new tree structure for mining erasable patterns in data streams. Appl Intell 49(2):478\u2013495","journal-title":"Appl Intell"},{"issue":"10","key":"1778_CR50","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","volume":"48","author":"Y Wu","year":"2018","unstructured":"Wu Y, Tong Y, Zhu X, Wu X (2018) NOSEP: nonoverlapping sequence pattern mining with gap constraints. IEEE Trans Cybern 48(10):2809\u20132822","journal-title":"IEEE Trans Cybern"},{"key":"1778_CR51","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.ins.2018.04.013","volume":"507","author":"F Min","year":"2020","unstructured":"Min F, Zhang Z, Zhai WJ, Shen RP (2020) Frequent pattern discovery with tri-partition alphabets. Inf Sci 507:715\u2013732","journal-title":"Inf Sci"},{"issue":"1","key":"1778_CR52","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/IDA-163231","volume":"22","author":"W Song","year":"2018","unstructured":"Song W, Jiang B, Qiao Y (2018) Mining multi-relational high utility itemsets from star schemas. Intelligent Data Analysis 22(1):143\u2013165","journal-title":"Intelligent Data Analysis"},{"key":"1778_CR53","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.future.2018.12.029","volume":"95","author":"U Yun","year":"2019","unstructured":"Yun U, Nam H, Lee G, Yoon E (2019) Efficient approach for incremental high utility pattern mining with indexed list structure. Futur Gener Comput Syst 95:221\u2013239","journal-title":"Futur Gener Comput Syst"},{"key":"1778_CR54","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.knosys.2016.10.011","volume":"115","author":"F Xie","year":"2017","unstructured":"Xie F, Wu X, Zhu X (2017) Efficient sequential pattern mining with wildcards for keyphrase extraction. Knowl-Based Syst 115:27\u201339","journal-title":"Knowl-Based Syst"},{"key":"1778_CR55","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, Xie F, Wu X (2013) Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph. Appl Intell 39:57\u201374","journal-title":"Appl Intell"},{"key":"1778_CR56","doi-asserted-by":"crossref","unstructured":"Wu Y, Zhu C, Li Y, Guo L, Wu X (2020) NetNCSP: nonoverlapping closed sequential pattern mining. Knowledge-Based Systems","DOI":"10.1016\/j.knosys.2020.105812"},{"key":"1778_CR57","first-page":"113","volume":"1974","author":"MJ Fischer","year":"1974","unstructured":"Fischer MJ, Paterson MS (1974) String-matching and other products. Proceedings of the 7th SIAM ANS Complexity of Computation 1974:113\u2013125","journal-title":"Proceedings of the 7th SIAM ANS Complexity of Computation"},{"issue":"3","key":"1778_CR58","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(91)90032-D","volume":"37","author":"U Manber","year":"1991","unstructured":"Manber U, Baeza\u2013Yates R (1991) An algorithm for string matching with a sequence of don\u2019t cares. Inf Process Lett 37(3):133\u2013136","journal-title":"Inf Process Lett"},{"key":"1778_CR59","first-page":"194","volume":"2009","author":"F Min","year":"2009","unstructured":"Min F, Wu X, Lu Z (2009) Pattern matching with independent wildcard gaps. Proceedings of the 8th International Conference on Pervasive Intelligence and Computing 2009:194\u2013199","journal-title":"Proceedings of the 8th International Conference on Pervasive Intelligence and Computing"},{"key":"1778_CR60","doi-asserted-by":"crossref","unstructured":"Wu Y, Wu X, Min F, Li Y (2010) A Nettree for pattern matching with flexible wildcard constraints. In: 2010 IEEE international conference on information reuse and integration, vol 2010, pp 109\u2013114","DOI":"10.1109\/IRI.2010.5558954"},{"issue":"3","key":"1778_CR61","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0022-0000(84)90018-7","volume":"28","author":"MK Warmuth","year":"1984","unstructured":"Warmuth MK, David H (1984) On the complexity of iterated shuffle. J Comput Syst Sci 28 (3):345\u2013358","journal-title":"J Comput Syst Sci"},{"key":"1778_CR62","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/DSC.2016.49","volume":"2016","author":"D Guo","year":"2016","unstructured":"Guo D, Yuan E, Hu X (2016) Frequent pattern mining based on approximate edit distance matrix. IEEE First International Conference on Data Science in Cyberspace (DSC) 2016:179\u2013188","journal-title":"IEEE First International Conference on Data Science in Cyberspace (DSC)"},{"key":"1778_CR63","first-page":"138","volume":"2010","author":"F Min","year":"2010","unstructured":"Min F, Wu Y, Wu X (2010) The Apriori property of sequence pattern mining with wildcard gaps. IEEE International Conference on Bioinformatics and Biomedicine Workshops 2010:138\u2013143","journal-title":"IEEE International Conference on Bioinformatics and Biomedicine Workshops"},{"issue":"2","key":"1778_CR64","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10618-007-0064-z","volume":"15","author":"J Lin","year":"2007","unstructured":"Lin J, Keogh E, Wei L, Lonardi S (2007) Experiencing SAX: a novel symbolic representation of time series. Data Min Knowl Disc 15(2):107\u2013144","journal-title":"Data Min Knowl Disc"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01778-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01778-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01778-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T00:20:36Z","timestamp":1625876436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01778-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,10]]},"references-count":64,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1778"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01778-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,10]]},"assertion":[{"value":"10 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}