{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:56Z","timestamp":1760596256525},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,25]],"date-time":"2014-11-25T00:00:00Z","timestamp":1416873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10489-014-0612-3","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T14:59:21Z","timestamp":1417445961000},"page":"566-580","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Strict approximate pattern matching with general gaps"],"prefix":"10.1007","volume":"42","author":[{"given":"Youxi","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Fu","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":[[2014,11,25]]},"reference":[{"issue":"5","key":"612_CR1","first-page":"897","volume":"32","author":"K Chouvalit","year":"2013","unstructured":"Chouvalit K, Veera B (2013) A new linear-time dynamic dictionary matching algorithm. Comput Inform 32(5):897\u2013923","journal-title":"Comput Inform"},{"issue":"2","key":"612_CR2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10115-013-0614-1","volume":"39","author":"J Aligon","year":"2014","unstructured":"Aligon J, Golfarelli M, Marcel P, Rizzi S, Turricchia E (2014) Similarity measures for OLAP sessions. Knowl Inf Syst 39(2):463\u2013489","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"612_CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth DE, Morris JH, Pratt VR (1977) Fast pattern matching in strings. SIAM J. Comput 6(2):323\u2013350","journal-title":"SIAM J. Comput"},{"key":"612_CR4","unstructured":"Fischer MJ , Paterson MS (1974) String matching and other products . In: Proceedings of the 7th SIAM AMS complexity of computation, Cambridge, USA, pp 113-125"},{"issue":"2","key":"612_CR5","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 YR (1991) An algorithm for string matching with a sequence of don\u2019t cares. Inf Process Lett 37(2):133\u2013136","journal-title":"Inf Process Lett"},{"issue":"6","key":"612_CR6","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G Navarro","year":"2003","unstructured":"Navarro G, Raffinot M (2003) Fast and simple character classes and bounded gaps pattern matching with applications to protein searching. J Comput Biol 10(6):903\u2013923","journal-title":"J Comput Biol"},{"key":"612_CR7","doi-asserted-by":"crossref","unstructured":"Cole R, Gottlieb L, Lewenstein M (2004) Dictionary matching and indexing with errors and don\u2019t cares. In: Proceedings of the 36th ACM symposium on the theory of computing, Chicago, USA, pp 91-100","DOI":"10.1145\/1007352.1007374"},{"issue":"1","key":"612_CR8","first-page":"54","volume":"9","author":"M Crochemore","year":"2002","unstructured":"Crochemore M, Iliopoulos C, Makris C, Rytter W, Tsakalidis A, Trichlas K (2002) Approximate string matching with gaps. Nord J Comput 9(1):54\u201365","journal-title":"Nord J Comput"},{"issue":"6","key":"612_CR9","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 (2009) New efficient bit-parallel algorithms for the (\u03b4, \u03b1)-matching problem with applications in music information retrieval. Int J Found Comput Sci 20(6):1087\u20131108","journal-title":"Int J Found Comput Sci"},{"issue":"2","key":"612_CR10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10115-006-0038-2","volume":"11","author":"X Ji","year":"2007","unstructured":"Ji X, Bailey J, Dong G (2007) Mining minimal distinguishing subsequence patterns with gap constraints. Knowl Inf Syst 11(2):259\u2013286","journal-title":"Knowl Inf Syst"},{"key":"612_CR11","unstructured":"Ferreira PG, Azevedo PJ (2005) Protein sequence pattern mining with constraints. In: European conference on principles and practice of knowledge discovery in databases (PKDD), Porto, Portugal, pp 96-107"},{"issue":"2","key":"612_CR12","doi-asserted-by":"crossref","first-page":"7\u2013es","DOI":"10.1145\/1267066.1267068","volume":"1","author":"M Zhang","year":"2007","unstructured":"Zhang M, Kao B, Cheung D, Yip K (2007) Mining periodic patterns with gap requirement from sequences. ACM Trans Knowl Discov Data 1(2):7\u2013es","journal-title":"ACM Trans Knowl Discov Data"},{"key":"612_CR13","unstructured":"Zhu X, Wu X (2007) Mining complex patterns across sequences with gap requirements. In: Proceedings of the 20th international joint conference on artificial intelligence (IJCAI), Hyderabad, India, pp 2934\u20132940"},{"issue":"1","key":"612_CR14","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\u2013116","journal-title":"Appl Intell"},{"issue":"2","key":"612_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10115-012-0501-1","volume":"37","author":"CY Tsai","year":"2013","unstructured":"Tsai CY, Chen CJ, Chien CJ (2013) A time-interval sequence classification method. Knowl Inf Syst 37(2):251\u2013278","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"612_CR16","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. J Softw 24(5):915\u2013932","journal-title":"J Softw"},{"key":"612_CR17","doi-asserted-by":"crossref","unstructured":"Fredriksson K, Grabowski S (2006) Efficient algorithms for pattern matching with general gaps and character classes . In: International conference on string processing and information retrieval, Glasgow, UK, pp 267-278","DOI":"10.1007\/11880561_22"},{"issue":"4","key":"612_CR18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10791-008-9054-z","volume":"11","author":"K Fredriksson","year":"2008","unstructured":"Fredriksson K, Grabowski S (2008) Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf Retrieval 11(4):335\u2013357","journal-title":"Inf Retrieval"},{"issue":"1","key":"612_CR19","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 Intelligence 39(1):57\u201374","journal-title":"Appl Intelligence"},{"key":"612_CR20","doi-asserted-by":"crossref","unstructured":"Huang Y, Wu X, Hu X, Xie F, Gao J, Wu G (2009) Mining frequent patterns with gaps and one-off condition . In: IEEE international conference on computational science and engineering (CSE\u201909), Vancouver, BC, Canada, pp 180\u2013186","DOI":"10.1109\/CSE.2009.160"},{"issue":"1","key":"612_CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"HT Lam","year":"2014","unstructured":"Lam HT, M\u00f6rchen F, Fradkin D (2014) Mining compressing sequential patterns. Stat Anal Data Min 7(1):34\u201352","journal-title":"Stat Anal Data Min"},{"key":"612_CR22","doi-asserted-by":"crossref","unstructured":"Ding B, Lo D, Han J (2009) Efficient mining of closed repetitive gapped subsequences from a sequence database . In: IEEE 25th international conference on data engineering(ICDE), Shanghai, China, pp 1024\u20131035","DOI":"10.1109\/ICDE.2009.104"},{"key":"612_CR23","doi-asserted-by":"crossref","unstructured":"Min F, Wu X, Lu Z (2009) Pattern matching with independent wildcard gaps. In: Proceedings of the 8th international conference on pervasive intelligence and computing, Chengdu, China, pp 194\u2013199","DOI":"10.1109\/DASC.2009.65"},{"key":"612_CR24","doi-asserted-by":"crossref","unstructured":"Bille P, G\u00f8rtz I, Vildh\u00f8j H, Wind D (2010) String matching with variable length gaps. In: Proceedings of the 17th international conference on string processing and information retrieval, SPIRE, Mexico, pp 385-394","DOI":"10.1007\/978-3-642-16321-0_40"},{"key":"612_CR25","doi-asserted-by":"crossref","unstructured":"Rahman S, Iliopoulos C , Lee I, Mohamed M , Smyth W (2006) Finding patterns with variable length gaps or don\u2019t cares. In: 12th annual international conference computing and combinatorics, Taiwan, pp 146-155","DOI":"10.1007\/11809678_17"},{"key":"612_CR26","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, IL G\u00f8rtz, Vildh\u00f8j HW (2012) String matching with variable length gaps. Theor Comput Sci 443:25\u201334","journal-title":"Theor Comput Sci"},{"key":"612_CR27","doi-asserted-by":"crossref","unstructured":"He D, Wu X, Zhu X (2007) SAIL-APPROX: An efficient on-line algorithm for approximate pattern matching with wildcards and length constraints. In: Proceedings of the 2007 IEEE international conference on bioinformatics and biomedicine (BIBM\u201907), Silicon Valley, USA, pp 151-0-158","DOI":"10.1109\/BIBM.2007.48"},{"key":"612_CR28","doi-asserted-by":"crossref","unstructured":"Wu Y, Wu X, Min F, Li Y (2010) A Nettree for pattern matching with flexible wildcard constraints . In: Proceedings of the 2010 IEEE international conference on information reuse and integration (IRI2010), Las Vegas, USA, pp 109-114","DOI":"10.1109\/IRI.2010.5558954"},{"issue":"1","key":"612_CR29","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10115-012-0546-1","volume":"36","author":"F Rasheed","year":"2013","unstructured":"Rasheed F, Adnan M, Alhajj R (2013) Out-of-core detection of periodicity from sequence databases. Knowl Inf Syst 36(1): 277\u2013301","journal-title":"Knowl Inf Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0612-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0612-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0612-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T00:37:16Z","timestamp":1566088636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0612-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,25]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["612"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0612-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,25]]}}}