{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:18:55Z","timestamp":1725567535296},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163203"},{"type":"electronic","value":"9783642163210"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_40","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T10:51:32Z","timestamp":1286275892000},"page":"385-394","source":"Crossref","is-referenced-by-count":9,"title":["String Matching with Variable Length Gaps"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inge","family":"Li G\u00f8rtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hjalte Wedel","family":"Vildh\u00f8j","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David Kofoed","family":"Wind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"40_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. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/11786986_56","volume-title":"Automata, Languages and Programming","author":"P. Bille","year":"2006","unstructured":"Bille, P.: New algorithms for regular expression matching. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 643\u2013654. Springer, Heidelberg (2006)"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Bille, P., Thorup, M.: Faster regular expression matching. In: Proc. 36th ICALP, pp. 171\u2013182 (2009)","DOI":"10.1007\/978-3-642-02927-1_16"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Bille, P., Thorup, M.: Regular expression matching with multi-strings and intervals. In: Proc. 21st SODA (2010)","DOI":"10.1137\/1.9781611973075.104"},{"key":"40_CR5","unstructured":"Bucher, P., Bairoch, A.: A generalized profile syntax for biomolecular sequence motifs and its function in automatic sequence interpretation. In: Proc. 2nd ISMB, pp. 53\u201361 (1994)"},{"issue":"1","key":"40_CR6","first-page":"54","volume":"9","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps. Nordic J. of Computing\u00a09(1), 54\u201365 (2002)","journal-title":"Nordic J. of Computing"},{"issue":"4","key":"40_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10791-008-9054-z","volume":"11","author":"K. Fredriksson","year":"2008","unstructured":"Fredriksson, K., Grabowski, S.: Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr.\u00a011(4), 335\u2013357 (2008)","journal-title":"Inf. Retr."},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-00982-2_29","volume-title":"Language and Automata Theory and Applications","author":"K. Fredriksson","year":"2009","unstructured":"Fredriksson, K., Grabowski, S.: Nested counters in bit-parallel string matching. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 338\u2013349. Springer, Heidelberg (2009)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Hofmann, K., Bucher, P., Falquet, L., Bairoch, A.: The prosite database, its status in. Nucleic Acids Res.\u00a0(27), 215\u2013219 (1999)","DOI":"10.1093\/nar\/27.1.215"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., James, J., Morris, H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"40_CR11","unstructured":"Lee, I., Apostolico, A., Iliopoulos, C.S., Park, K.: Finding approximate occurrences of a pattern that contains gaps. In: Proc. 14th AWOCA, pp. 89\u2013100 (2003)"},{"issue":"8","key":"40_CR12","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. Bio.\u00a012(8), 1065\u20131082 (2005)","journal-title":"J. Comput. Bio."},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1089\/cmb.1996.3.33","volume":"3","author":"E.W. Myers","year":"1992","unstructured":"Myers, E.W.: Approximate matching of network expressions with spacers. J. Comput. Bio.\u00a03(1), 33\u201351 (1992)","journal-title":"J. Comput. Bio."},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1145\/128749.128755","volume":"39","author":"E.W. Myers","year":"1992","unstructured":"Myers, E.W.: A four-russian algorithm for regular expression pattern matching. J. ACM\u00a039(2), 430\u2013448 (1992)","journal-title":"J. ACM"},{"issue":"3","key":"40_CR15","first-page":"299","volume":"9","author":"G. Myers","year":"1993","unstructured":"Myers, G., Mehldau, G.: A system for pattern matching applications on biosequences. CABIOS\u00a09(3), 299\u2013314 (1993)","journal-title":"CABIOS"},{"issue":"6","key":"40_CR16","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. Bio.\u00a010(6), 903\u2013923 (2003)","journal-title":"J. Comput. Bio."},{"issue":"2","key":"40_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00453-004-1120-3","volume":"41","author":"G. Navarro","year":"2004","unstructured":"Navarro, G., Raffinot, M.: New techniques for regular expression searching. Algorithmica\u00a041(2), 89\u2013116 (2004)","journal-title":"Algorithmica"},{"key":"40_CR18","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":"40_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM\u00a011, 419\u2013422 (1968)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16321-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T03:13:26Z","timestamp":1559704406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}