{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:09:45Z","timestamp":1746245385617,"version":"3.40.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"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":["New Gener. Comput."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00354-014-0201-3","type":"journal-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T10:49:44Z","timestamp":1399027784000},"page":"95-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Matching Algorithm in PMWL based on CluTree"],"prefix":"10.1007","volume":"32","author":[{"given":"Yingling","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xue-gang","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,3]]},"reference":[{"key":"201_CR1","doi-asserted-by":"crossref","unstructured":"Kolpakov, R. and Kucherov, G., \u201cFinding repeats with fixed gap,\u201d in Proc. of the 7th Int\u20191 Symp. String Processing and Information Retrieval (SPIRE), Washington, IEEE Computer Society, pp. 162\u2013168, 2000.","DOI":"10.1109\/SPIRE.2000.878192"},{"issue":"1","key":"201_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10115-011-0427-z","volume":"32","author":"Z. Lin","year":"2012","unstructured":"Lin Z., Lyu M.R., King I.: \u201cMatchSim: a novel similarity measure based on maximum neighborhood matching,\u201d. Knowledge and Information Systems, 32(1), 141\u2013166 (2012)","journal-title":"Knowledge and Information Systems,"},{"issue":"1","key":"201_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"303","author":"R. Kolpakov","year":"2003","unstructured":"Kolpakov R., Kucherov G.: \u201cFinding approximate repetitions under hamming distance,\u201d. Theoretical Computer Science, 303(1), 135\u2013156 (2003)","journal-title":"Theoretical Computer Science,"},{"issue":"3","key":"201_CR4","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10115-012-0528-3","volume":"33","author":"P. Anchuri","year":"2012","unstructured":"Anchuri P., Zaki M. J., Barkol O. et\u00a0al.: \u201cGraph mining for discovering infrastructure patterns in configuration management databases,\u201d. Knowledge and Information Systems, 33(3), 491\u2013522 (2012)","journal-title":"Knowledge and Information Systems,"},{"key":"201_CR5","unstructured":"Fischer, M. J., Paterson, M. S., \u201cString matching and other products,\u201d in Complexity of computation (Karp, RM ed.), 7, Massachusetts Institute of Technology, Cambridge, MA, USA, pp. 113\u2013125, 1974."},{"issue":"3","key":"201_CR6","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-Yates R.: \u201cAn algorithm for string matching with a sequence of don\u2019t cares,\u201d. Inf. Proc. Lett., 37(3), 133\u2013136 (1991)","journal-title":"Inf. Proc. Lett.,"},{"key":"201_CR7","doi-asserted-by":"crossref","unstructured":"Muthukrishan, S. and Palem, K., \u201cNon-standard stringology: Algorithms and complexity,\u201d in Proc. of the 26th ACM Symposium on the Theory of Computing, ACM Press, New York, NY, USA, pp. 770\u2013779, 1994.","DOI":"10.1145\/195058.195457"},{"key":"201_CR8","doi-asserted-by":"crossref","unstructured":"Kucherov, G. and Rusinowitch, M., \u201cMatching a set of strings with variable length don\u2019t cares,\u201d in Proc. of the 6th Symposium on Combinatorial Pattern Matching, Berlin: Springer, pp. 230\u2013247, 1995.","DOI":"10.1007\/3-540-60044-2_46"},{"key":"201_CR9","doi-asserted-by":"crossref","unstructured":"Indyk, P., \u201cFaster algorithms for string matching problems: Matching the convolution bound,\u201d in Proc. of the 39th Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA, pp. 166\u2013173, 1998.","DOI":"10.1109\/SFCS.1998.743440"},{"key":"201_CR10","unstructured":"Kalai, A., \u201cEfficient pattern-matching with don\u2019t cares,\u201d in Proc. of the 13 th ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 655\u2013656, 2002."},{"key":"201_CR11","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.A., Lewenstein, M., \u201cDictionary matching and indexing with errors and don\u2019t cares,\u201d in Proc. of the 36th ACM Symposium on the Theory of Computing, ACM Press, New York, NY, USA, pp.91\u2013100, 2004.","DOI":"10.1145\/1007352.1007374"},{"key":"201_CR12","doi-asserted-by":"crossref","unstructured":"Navarro, G. and Raffinot, M., Flexible pattern matching in strings: Practical on-line search algorithms for texts and biological sequences, Cambridge, UK: Cambridge University Press, 2002.","DOI":"10.1017\/CBO9781316135228"},{"key":"201_CR13","doi-asserted-by":"crossref","unstructured":"Navarro, G. and Raffinot, M., \u201cFast and simple character classes and bounded gaps pattern matching, with applications to protein searching,\u201d Computational Biology, 10, 6, pp. 903\u2013923, 2003.","DOI":"10.1089\/106652703322756140"},{"issue":"4","key":"201_CR14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10115-006-0016-8","volume":"10","author":"G. Chen","year":"2006","unstructured":"Chen G., Wu X., Zhu X., Arslan Abdullah N., He Y.: \u201cEfficient String Matching with Wildcards and Length Constraints,\u201d. Knowledge and Information Systems 10(4), 399\u2013419 (2006)","journal-title":"Knowledge and Information Systems"},{"key":"201_CR15","doi-asserted-by":"crossref","unstructured":"Hong, X., Wu, X., Hu, X., Liu, Y., Gao, J., Wu, G., \u201cBPBM: An Algorithm for String Matching with Wildcards and Length Constraints,\u201d PreMI\u201909&RSFDGrC\u201909, pp. 518\u2013525, 2009.","DOI":"10.1007\/978-3-642-10646-0_63"},{"key":"201_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wu, X., Hu, X., Gao, J., Wu, G., Wang, H., and Hong, X., \u201cPattern Matching with Wildcards based on Key Character Location,\u201d Proc. of the 2009 IEEE International Conference in Information Reuse and Integration (IRI-2009), Las Vegas, USA, pp.167\u2013170, 2009.","DOI":"10.1109\/IRI.2009.5211545"},{"key":"201_CR17","unstructured":"He, D., Arslan, Abdullah N., He, Y. and Wu, X., \u201cIterative Refinement of Repeat Sequence Specification Using Constrained Pattern Matching,\u201d Proc. of the IEEE 7th International Symposium on Bioinformatics & Bioengineering (BIBE 2007), Harvard Medical School Conference Center, Cambridge - Boston, Massachusetts, USA, pp. 1199\u20131203, 2007."},{"key":"201_CR18","doi-asserted-by":"crossref","unstructured":"Wu, Y., Wu, X., Min, F. and Li, Y., \u201cA Nettree for Pattern Matching with Flexible Wildcard Constraints,\u201d Proc. of the 11th IEEE International Conference on Information Reuse and Integration (IRI 2010), Las Vegas, USA, pp. 109\u2013114, 2010.","DOI":"10.1109\/IRI.2010.5558954"},{"key":"201_CR19","doi-asserted-by":"crossref","unstructured":"Min, F., Wu, X. and Lu, Z., \u201cPattern Matching with Independent Wildcard Gaps,\u201d Proc. of the 8th International Conference on Pervasive Intelligence and Computing (PICom 2009), Chengdu, China, pp. 194\u2013199, 2009.","DOI":"10.1109\/DASC.2009.65"},{"key":"201_CR20","unstructured":"http:\/\/www.ncbi.nlm.nih.gov\/"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-014-0201-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-014-0201-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-014-0201-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T17:12:22Z","timestamp":1746205942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-014-0201-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s00354-014-0201-3","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}