{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T20:05:00Z","timestamp":1726085100503},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030487904"},{"type":"electronic","value":"9783030487911"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48791-1_35","type":"book-chapter","created":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T10:02:52Z","timestamp":1590573772000},"page":"447-459","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Detecting Pattern Efficiently with Don\u2019t Cares"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3157-8086","authenticated-orcid":false,"given":"Hayam","family":"Alamro","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3909-0077","authenticated-orcid":false,"given":"Costas","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,28]]},"reference":[{"issue":"6","key":"35_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"35_CR2","unstructured":"Alamro, H., Badkobeh, G., Belazzougui, D., Iliopoulos, C.S., Puglisi, S.J.: Computing the antiperiod (s) of a string. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"35_CR3","unstructured":"Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. no. 98CB36280), pp. 534\u2013543. IEEE (1998)"},{"issue":"2","key":"35_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0196-6774(03)00097-X","volume":"50","author":"A Amir","year":"2004","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257\u2013275 (2004)","journal-title":"J. Algorithms"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00224-013-9498-4","volume":"55","author":"P Bille","year":"2014","unstructured":"Bille, P., G\u00f8rtz, I.L., Vildh\u00f8j, H.W., Vind, S.: String indexing for patterns with wildcards. Theory Comput. Syst. 55(1), 41\u201360 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"10","key":"35_CR6","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762\u2013772 (1977). \nhttps:\/\/doi.org\/10.1145\/359842.359859","journal-title":"Commun. ACM"},{"issue":"4","key":"35_CR7","doi-asserted-by":"publisher","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, A.N., He, Y.: Efficient string matching with wildcards and length constraints. Knowl. Inf. Syst. 10(4), 399\u2013419 (2006)","journal-title":"Knowl. Inf. Syst."},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jcss.2009.06.002","volume":"76","author":"R Clifford","year":"2010","unstructured":"Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: Pattern matching with don\u2019t cares and few errors. J. Comput. Syst. Sci. 76(2), 115\u2013124 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Clifford, R., Porat, E.: A filtering algorithm for k-mismatch with don\u2019t cares. In: International Symposium on String Processing and Information Retrieval, pp. 130\u2013136. Springer (2007)","DOI":"10.1007\/978-3-540-75530-2_12"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 91\u2013100 (2004)","DOI":"10.1145\/1007352.1007374"},{"issue":"6","key":"35_CR11","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/S0097539700370527","volume":"31","author":"R Cole","year":"2002","unstructured":"Cole, R., Hariharan, R.: Approximate string matching: a simpler faster algorithm. SIAM J. Comput. 31(6), 1761\u20131782 (2002)","journal-title":"SIAM J. Comput."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Commentz-Walter, B.: A string matching algorithm fast on the average. In: International Colloquium on Automata, Languages, and Programming, pp. 118\u2013132. Springer (1979)","DOI":"10.1007\/3-540-09510-1_10"},{"key":"35_CR14","volume-title":"Algorithms and Theory of Computation Handbook","author":"Maxime Crochemore","year":"1998","unstructured":"Crochemore, M., Hancart, C.: Pattern matching in strings. In: Mikhail, J.A. (ed.) Algorithms and Theory of Computation Handbook, pp. 11.1\u201311.28. CRC Press (1998). \nhttps:\/\/hal-upec-upem.archives-ouvertes.fr\/hal-00620790"},{"key":"35_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Perrin, D.: Pattern matching in strings. In: Image Analysis and Processing II, pp. 67\u201379. Springer (1988)","DOI":"10.1007\/978-1-4613-1007-5_6"},{"key":"35_CR17","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 137\u2013143. IEEE (1997)"},{"issue":"8\u20139","key":"35_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ipl.2010.02.014","volume":"110","author":"J Fischer","year":"2010","unstructured":"Fischer, J., Huson, D.H.: New common ancestor problems in trees and directed acyclic graphs. Inf. Process. Lett. 110(8\u20139), 331\u2013335 (2010)","journal-title":"Inf. Process. Lett."},{"key":"35_CR19","unstructured":"Fischer, M.J., Paterson, M.S.: String-matching and other products. Tech. rep. Massachusetts Institute of Technology, Cambridge Project MAC (1974)"},{"issue":"4","key":"35_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/8307.8309","volume":"17","author":"Z Galil","year":"1986","unstructured":"Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. ACM SIGACT News 17(4), 52\u201354 (1986)","journal-title":"ACM SIGACT News"},{"issue":"4","key":"35_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/270563.571472","volume":"28","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on stings, trees, and sequences: computer science and computational biology. ACM SIGACT News 28(4), 41\u201360 (1997)","journal-title":"ACM SIGACT News"},{"key":"35_CR22","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Pattern matching algorithms with don\u2019t cares. In: Proceedings of 33rd SOFSEM, pp. 116\u2013126 (2007)"},{"key":"35_CR23","unstructured":"Indyk, P.: Faster algorithms for string matching problems: matching the convolution bound. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. no. 98CB36280), pp. 166\u2013173. IEEE (1998)"},{"key":"35_CR24","unstructured":"Kalai, A.T.: Efficient pattern-matching with don\u2019t cares. In: SODA 2002 Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655\u2013656. ACM Press (January 2002). \nhttps:\/\/www.microsoft.com\/en-us\/research\/publication\/efficient-pattern-matching-dont-cares\/"},{"issue":"2","key":"35_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"35_CR26","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"35_CR27","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Sung, W.K., Tam, S.L., Yiu, S.M.: Space efficient indexes for string matching with don\u2019t cares. In: International Symposium on Algorithms and Computation, pp. 846\u2013857. Springer (2007)","DOI":"10.1007\/978-3-540-77120-3_73"},{"issue":"2","key":"35_CR28","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"GM Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10(2), 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"issue":"4","key":"35_CR29","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1007\/s10044-018-0733-0","volume":"21","author":"N Liu","year":"2018","unstructured":"Liu, N., Xie, F., Wu, X.: Multi-pattern matching with variable-length wildcards using suffix tree. Pattern Anal. Appl. 21(4), 1151\u20131165 (2018)","journal-title":"Pattern Anal. Appl."},{"key":"35_CR30","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ipl.2016.10.003","volume":"118","author":"M Nicolae","year":"2017","unstructured":"Nicolae, M., Rajasekaran, S.: On pattern matching with k mismatches and few don\u2019t cares. Inf. Process. Lett. 118, 78\u201382 (2017)","journal-title":"Inf. Process. Lett."},{"key":"35_CR31","doi-asserted-by":"crossref","unstructured":"Pinter, R.Y.: Efficient string matching with don\u2019t-care patterns. In: Combinatorial Algorithms on Words, pp. 11\u201329. Springer (1985)","DOI":"10.1007\/978-3-642-82456-2_2"},{"key":"35_CR32","doi-asserted-by":"crossref","unstructured":"Rahman, M.S., Iliopoulos, C.S., Lee, I., Mohamed, M., Smyth, W.F.: Finding patterns with variable length gaps or don\u2019t cares. In: International Computing and Combinatorics Conference, pp. 146\u2013155. Springer (2006)","DOI":"10.1007\/11809678_17"},{"key":"35_CR33","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 320\u2013328. IEEE (1996)"},{"key":"35_CR34","doi-asserted-by":"publisher","DOI":"10.1201\/9781420070347","volume-title":"Algorithms in Bioinformatics: A Practical Introduction","author":"WK Sung","year":"2009","unstructured":"Sung, W.K.: Algorithms in Bioinformatics: A Practical Introduction. CRC Press, Boca Raton (2009)"},{"issue":"3","key":"35_CR35","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"35_CR36","unstructured":"Wu, S., Manber, U., et al.: A fast algorithm for multi-pattern searching. University of Arizona, Department of Computer Science (1994)"},{"key":"35_CR37","unstructured":"Ziviani, N., Baeza-Yates, R.: String processing and information retrieval. In: 14th International Symposium, SPIRE 2007 Santiago, Chile, October 29\u201331, 2007 Proceedings, vol. 4726. Springer (2007)"}],"container-title":["Proceedings of the International Neural Networks Society","Proceedings of the 21st EANN (Engineering Applications of Neural Networks) 2020 Conference"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48791-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T10:13:38Z","timestamp":1590574418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48791-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030487904","9783030487911"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48791-1_35","relation":{},"ISSN":["2661-8141","2661-815X"],"issn-type":[{"type":"print","value":"2661-8141"},{"type":"electronic","value":"2661-815X"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Engineering Applications of Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halkidiki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eann2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.eann2020.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}