{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:24Z","timestamp":1725566904916},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_25","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"288-297","source":"Crossref","is-referenced-by-count":4,"title":["A Simple Fast Hybrid Pattern-Matching Algorithm"],"prefix":"10.1007","author":[{"given":"Frantisek","family":"Franek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher G.","family":"Jennings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William F.","family":"Smyth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"25_CR1","first-page":"762","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. Assoc. Comput. Mach.\u00a020(10), 762\u2013772 (1977)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"25_CR2","unstructured":"Charras, C., Lecroq, T.: Exact String Matching Algorithms, Laboratoire d\u2019Informatique, Universit\u00e9 de Rouen (1997), \n                  \n                    http:\/\/www-igm.univ-mlv.fr\/~lecroq\/string\/index.html"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Tighter bounds on the exact complexity of string matching. In: Proc. 33rd IEEE Symp. Found. Comp. Sci., pp. 600\u2013609 (1992)","DOI":"10.1109\/SFCS.1992.267791"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/S0097539793245829","volume":"24","author":"R. Cole","year":"1995","unstructured":"Cole, R., Hariharan, R., Paterson, M.S., Zwick, U.: Tighter lower bounds on the exact complexity of string matching. SIAM J. Comput.\u00a024(1), 30\u201345 (1995)","journal-title":"SIAM J. Comput."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0890-5401(91)90046-5","volume":"95","author":"L. Colussi","year":"1991","unstructured":"Colussi, L.: Correctness and efficiency of pattern matching algorithms. Information & Computation\u00a095, 225\u2013251 (1991)","journal-title":"Information & Computation"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/jagm.1994.1008","volume":"16","author":"L. Colussi","year":"1994","unstructured":"Colussi, L.: Fastest pattern matching in strings. J. Algs.\u00a016(2), 163\u2013189 (1994)","journal-title":"J. Algs."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Colussi, L., Galil, Z., Giancarlo, R.: On the exact complexity of string matching. In: Proc. 31st IEEE Symp. Found. Comp. Sci., vol.\u00a0I, pp. 135\u2013143 (1990)","DOI":"10.1109\/FSCS.1990.89532"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Ga\u0327sieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two stringmatching algorithms. Algorithmica\u00a012, 247\u2013267 (1994)","journal-title":"Algorithmica"},{"key":"25_CR9","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du Texte, Vuibert, Paris (2001)"},{"issue":"6","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/0220063","volume":"20","author":"Z. Galil","year":"1991","unstructured":"Galil, Z., Giancarlo, R.: On the exact complexity of string matching: lower bounds. SIAM J. Comput.\u00a020(6), 1008\u20131020 (1991)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/0221028","volume":"21","author":"Z. Galil","year":"1992","unstructured":"Galil, Z., Giancarlo, R.: On the exact complexity of string matching: upper bounds. SIAM J. Comput.\u00a021(3), 407\u2013437 (1992)","journal-title":"SIAM J. Comput."},{"key":"25_CR12","unstructured":"Hart, M.: Project Gutenberg, Project Gutenberg Literary Archive Foundation (2004), \n                  \n                    http:\/\/www.gutenberg.net"},{"issue":"6","key":"25_CR13","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R. Nigel Horspool","year":"1980","unstructured":"Nigel Horspool, R.: Practical fast searching in strings. Software \u2013 Practice & Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software \u2013 Practice & Experience"},{"issue":"11","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1002\/spe.4380211105","volume":"21","author":"A. Hume","year":"1991","unstructured":"Hume, A., Sunday, D.: Fast string searching. Software \u2013 Practice & Experience\u00a021(11), 1221\u20131248 (1991)","journal-title":"Software \u2013 Practice & Experience"},{"key":"25_CR15","unstructured":"Jennings, C.G.: A Linear-Time Algorithm for Fast Exact Pattern Matching in Strings. M. Sc. thesis, McMaster University, p.\u00a097 (2002)"},{"issue":"2","key":"25_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"25_CR17","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1002\/spe.4380250703","volume":"25","author":"T. Lecroq","year":"1995","unstructured":"Lecroq, T.: Experimental results on string matching algorithms. Software \u2013 Practice & Experience\u00a025(7), 727\u2013765 (1995)","journal-title":"Software \u2013 Practice & Experience"},{"key":"25_CR18","unstructured":"Lecroq, T.: New Experimental Results on Exact String-Matching, Rapport LIFAR 2000.03, Universit\u00e9 de Rouen (2000)"},{"key":"25_CR19","unstructured":"Morris, J.H., Pratt, V.R.: A Linear Pattern-Matching Algorithm. Tech. Rep. 40, University of California, Berkeley (1970)"},{"key":"25_CR20","first-page":"423","volume-title":"Computing Patterns in Strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing Patterns in Strings, p. 423. Pearson Addison-Wesley, London (2003)"},{"issue":"8","key":"25_CR21","first-page":"132","volume":"33","author":"D.M. Sunday","year":"1990","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Commun. Assoc. Comput. Mach.\u00a033(8), 132\u2013142 (1990)","journal-title":"Commun. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:13Z","timestamp":1619505613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11496656_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}