{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T04:11:57Z","timestamp":1769832717380,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642206610","type":"print"},{"value":"9783642206627","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_7","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"76-87","source":"Crossref","is-referenced-by-count":20,"title":["Online Dictionary Matching with Variable-Length Gaps"],"prefix":"10.1007","author":[{"given":"Tuukka","family":"Haapasalo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panu","family":"Silvasti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seppo","family":"Sippu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. of the ACM\u00a018, 333\u2013340 (1975)","journal-title":"Commun. of the ACM"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-16321-0_40","volume-title":"String Processing and Information Retrieval","author":"P. Bille","year":"2010","unstructured":"Bille, P., Li G\u00f8rtz, I., Vildh\u00f8j, H.W., Wind, D.K.: String matching with variable length gaps. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 385\u2013394. Springer, Heidelberg (2010)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bille, P., Thorup, M.: Regular expression matching with multi-strings and intervals. In: Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 1297\u20131308 (2010)","DOI":"10.1137\/1.9781611973075.104"},{"key":"7_CR4","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.\u00a010, 399\u2013419 (2006)","journal-title":"Knowl. Inf. Syst."},{"key":"7_CR5","doi-asserted-by":"publisher","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. Inform. Process. Letters\u00a0101, 53\u201354 (2007)","journal-title":"Inform. Process. Letters"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing, pp. 90\u2013100 (2004)","DOI":"10.1145\/1007352.1007374"},{"key":"7_CR7","unstructured":"Fischer, M., Paterson, M.: String matching and other products. In: Proc. of the 7th SIAM-AMS Complexity of Computation, pp. 113\u2013125 (1974)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"He, D., Wu, X., Zhu, X.: SAIL-APPROX: an efficient on-line algorithm for approximate pattern matching with wildcards and length constraints. In: Proc. of the IEEE Internat. Conf. on Bioinformatics and Biomedicine, BIBM 2007, pp. 151\u2013158 (2007)","DOI":"10.1109\/BIBM.2007.48"},{"key":"7_CR9","unstructured":"Kalai, A.: Efficient pattern-matching with don\u2019t cares. In: Proc. of the 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 655\u2013656 (2002)"},{"key":"7_CR10","doi-asserted-by":"publisher","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.\u00a0178, 129\u2013154 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","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.\u00a012, 1065\u20131082 (2005)","journal-title":"J. Comput. Biol."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1002\/spe.411","volume":"31","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: NR-grep: a fast and flexible pattern-matching tool. Soft. Pract. Exper.\u00a031, 1265\u20131312 (2001)","journal-title":"Soft. Pract. Exper."},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings. Cambridge University Press, Cambridge (2002)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G. Navarro","year":"2003","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. J. Comput. Biol.\u00a010, 903\u2013923 (2003)","journal-title":"J. Comput. Biol."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Pinter, R.Y.: Efficient string matching. Combinatorial Algorithms on Words. NATO Advanced Science Institute Series F: Computer and System Sciences, vol.\u00a012, pp. 11\u201329 (1985)","DOI":"10.1007\/978-3-642-82456-2_2"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11809678_17","volume-title":"Computing and Combinatorics","author":"M.S. Rahman","year":"2006","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: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 146\u2013155. Springer, Heidelberg (2006)"},{"key":"7_CR17","doi-asserted-by":"publisher","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. Inform. Process. Letters\u00a0110, 216\u2013220 (2010)","journal-title":"Inform. Process. Letters"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:23:33Z","timestamp":1558574613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}