{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:26:08Z","timestamp":1743135968813,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420844"},{"type":"electronic","value":"9783319420851"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42085-1_26","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T02:50:27Z","timestamp":1467341427000},"page":"334-344","source":"Crossref","is-referenced-by-count":0,"title":["Multi-pattern Matching Algorithm with Wildcards Based on Euclidean Distance and Hash Function"],"prefix":"10.1007","author":[{"given":"Ahmed Abdo Farhan","family":"Saif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ipl.2006.08.002","volume":"101","author":"P Clifford","year":"2007","unstructured":"Clifford, P., Clifford, R.: Simple deterministic wildcard matching. Inf. Process. Lett. 101(2), 53\u201354 (2007)","journal-title":"Inf. Process. Lett."},{"key":"26_CR2","unstructured":"Fischer, M., Paterson, M.: String matching and other products. In: Karp, R., (ed.) Proceedings of the 7th SIAMAMS Complexity of Computation, pp. 113\u2013125 (1974)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Muthukrishan, S., Palem, K.: Non-standard stringology: algorithms and complexity. In: Proceedings of the 26th Symposium on the Theory of Computing, Canada (1994)","DOI":"10.1145\/195058.195457"},{"key":"26_CR4","unstructured":"Barton, C., Iliopoulos, C.S.: On the average-case complexity of pattern matching with wildcards. CoRR, abs\/1407.0950 (2014)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Faster algorithms for string matching problems: matching the convolution bound. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 166\u2013173 (1998)","DOI":"10.1109\/SFCS.1998.743440"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: [7] Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"26_CR7","first-page":"116","volume":"2","author":"M Rahman","year":"2007","unstructured":"Rahman, M., Iliopoulos, C.: Pattern matching algorithms with don\u2019t cares. SOFSEM 2, 116\u2013126 (2007)","journal-title":"SOFSEM"},{"issue":"3","key":"26_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jcss.2008.08.005","volume":"75","author":"C Linhart","year":"2009","unstructured":"Linhart, C., Shamir, R.: Faster pattern matching with character classes using prime number encoding. J. Comput. Syst. Sci. 75(3), 155\u2013162 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"26_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0304-3975(97)88195-9","volume":"178","author":"G Kucherov","year":"1997","unstructured":"Kucherov, G., Rusinowitch, M.: Matching a set of strings with variable length don\u2019t cares. Theor. Comput. Sci. 178(1\u20132), 129\u2013154 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"26_CR10","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.ipl.2009.12.007","volume":"110","author":"M Zhang","year":"2010","unstructured":"Zhang, M., Zhang, Y., Hu, L.: A faster algorithm for matching a set of patterns with variable length don\u2019t cares. Inf. Process. Lett. 110(6), 216\u2013220 (2010)","journal-title":"Inf. Process. Lett."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, M., Zhang, Y., Tang, J.: Multi-pattern matching with wildcards. In: Proceeding of Third International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2010) (2010)","DOI":"10.1109\/PAAP.2010.70"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Chan, H.-L., Hon, W.-K., Lam, T.W., Sadakane, K.: Compressed indexes for dynamic text collections. ACM Trans. Algorithms 3(2) (2007)","DOI":"10.1145\/1240233.1240244"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1006\/jpdc.1994.1083","volume":"22","author":"AA Bertossi","year":"1994","unstructured":"Bertossi, A.A., Logi, F.: Parallel string matching with variable length don\u2019t cares. J. Parallel Distrib. Comput. 22, 229\u2013234 (1994)","journal-title":"J. Parallel Distrib. Comput."},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31\u201355 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Ding, B., Lo, D., Han, J., Khoo, S.: Efficient mining of closed repetitive gapped subsequences from a sequence database. In: Proceedings of the 25th IEEE International Conference on Data Engineering, pp. 1024\u20131035 (2009)","DOI":"10.1109\/ICDE.2009.104"},{"issue":"5","key":"26_CR16","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.compbiomed.2013.02.006","volume":"43","author":"X Wu","year":"2013","unstructured":"Wu, X., Zhu, X., He, Y., Arslan, A.N.: PMBC: pattern mining from biological sequences with wildcard constraints. Comput. Biol. Med. 43(5), 481\u2013492 (2013)","journal-title":"Comput. Biol. Med."},{"key":"26_CR17","first-page":"14","volume":"9","author":"J Qiang","year":"2013","unstructured":"Qiang, J., Guo, D., Fang, Y., Tian, W., Hu, X.: Multiple pattern matching with wildcards and one-off condition. J. Comput. Inf. Syst. 9, 14 (2013)","journal-title":"J. Comput. Inf. Syst."},{"issue":"1","key":"26_CR18","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.: Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph. Appl. Intell. 39(1), 57\u201374 (2013)","journal-title":"Appl. Intell."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. In: Proceedings of the 5th Annual International Conference on Computational Biology, pp. 231\u2013240 (2001)","DOI":"10.1145\/369133.369220"},{"issue":"8","key":"26_CR20","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1089\/cmb.2005.12.1065","volume":"12","author":"M Morgante","year":"2005","unstructured":"Morgante, M., Policriti, A., Vitacolonna, N., Zuccolo, A.: Structured motifs search. J. Comput. Biol. 12(8), 1065\u20131082 (2005)","journal-title":"J. Comput. Biol."},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, pp. 91\u2013100 (2004)","DOI":"10.1145\/1007352.1007374"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-642-20662-7_7","volume-title":"Experimental Algorithms","author":"T Haapasalo","year":"2011","unstructured":"Haapasalo, T., Silvasti, P., Sippu, S., Soisalon-Soininen, E.: Online dictionary matching with variable-length gaps. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 76\u201387. Springer, Heidelberg (2011)"},{"issue":"C","key":"26_CR23","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.jda.2015.08.003","volume":"35","author":"AN Arslan","year":"2015","unstructured":"Arslan, A.N., He, D., He, Y., Wu, X.: Pattern matching with wildcards and length constraints using maximum network flow. J. Discrete Algorithms 35(C), 9\u201316 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"26_CR24","unstructured":"Kalai,A.: Efficient pattern-matching with don\u2019t cares. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655\u2013656 (2002)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42085-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T09:58:03Z","timestamp":1568109483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}