{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:32Z","timestamp":1725540692002},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_26","type":"book-chapter","created":{"date-parts":[[2012,12,20]],"date-time":"2012-12-20T23:32:11Z","timestamp":1356046331000},"page":"236-248","source":"Crossref","is-referenced-by-count":1,"title":["A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching"],"prefix":"10.1007","author":[{"given":"Bruce W.","family":"Watson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derrick G.","family":"Kourie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tinus","family":"Strauss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Berry, T., Ravindran, S.: A fast string matching algorithm and experimental results. In: Holub, J., Sim\u00e1nek, M. (eds.) Proceedings of the Prague Stringology Club Workshop 1999, pp. 16\u201326. No. Collaborative Report DC-99-05, Czech Technical University, Prague, Czech Republic (1999)"},{"issue":"10","key":"26_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM\u00a020(10), 62\u201372 (1977)","journal-title":"Communications of the ACM"},{"key":"26_CR3","unstructured":"Charras, C., Lecroq, T.: Handbook of exact string matching algorithms. Kings College Publications (2004)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1016\/j.scico.2010.04.012","volume":"75","author":"L. Cleophas","year":"2010","unstructured":"Cleophas, L., Watson, B.W., Zwaan, G.: A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms. Science of Computer Programming\u00a075, 1095\u20131112 (2010)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1049\/ip-sen:20041265","volume":"152","author":"L.G. Cleophas","year":"2005","unstructured":"Cleophas, L.G., Watson, B.W.: Taxonomy-Based Software Construction of SPARE Time: A case study. IEE Proceedings \u2014 Software\u00a0152(1), 29\u201337 (2005)","journal-title":"IEE Proceedings \u2014 Software"},{"key":"26_CR6","unstructured":"Crochemore, M.A., Rytter, W.: Text Algorithms. Oxford University Press (1994)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Crochemore, M.A., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company (2003)","DOI":"10.1142\/9789812778222"},{"key":"26_CR8","first-page":"1","volume-title":"Proceedings of the Prague Stringology Conference 2011","author":"S. Faro","year":"2011","unstructured":"Faro, S., Lecroq, T.: 2001\u20132010: Ten years of exact string matching algorithms. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2011, pp. 1\u20132. Czech Technical University in Prague, Czech Republic (2011)"},{"issue":"6","key":"26_CR9","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Software \u2014 Practice & Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software \u2014 Practice & Experience"},{"issue":"2","key":"26_CR10","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., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Kourie, D.G., Watson, B.W.: The Correctness-by-Construction Approach to Programming. Springer (2012)","DOI":"10.1007\/978-3-642-27919-5"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Mauch, M., Watson, B.W., Kourie, D.G., Strauss, T.: Performance assessment of dead-zone single keyword pattern matching. In: Kroeze, J. (ed.) Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference, Pretoria, South Africa (October 2012)","DOI":"10.1145\/2389836.2389844"},{"key":"26_CR13","unstructured":"Meyer, B.: Object-Oriented Software Construction, 2nd edn. Addison-Wesley (1998)"},{"key":"26_CR14","unstructured":"Smyth, W.F.: Computing Patterns in Strings. Addison-Wesley (2003)"},{"key":"26_CR15","unstructured":"Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. Ph.D dissertation. Eindhoven University of Technology, Eindhoven, Netherlands (1995)"},{"issue":"7","key":"26_CR16","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1002\/spe.590","volume":"34","author":"B.W. Watson","year":"2004","unstructured":"Watson, B.W., Cleophas, L.: SPARE Parts: A C++ toolkit for String Pattern Recognition. Software \u2014 Practice & Experience\u00a034(7), 697\u2013710 (2004)","journal-title":"Software \u2014 Practice & Experience"},{"key":"26_CR17","unstructured":"Watson, B.W., Watson, R.E.: A new family of string pattern matching algorithms. In: Holub, J. (ed.) Proceedings of the Second Prague Stringologic Workshop, pp. 12\u201323. Czech Technical University, Prague, Czech Republic (July 1997)"},{"key":"26_CR18","first-page":"34","volume":"30","author":"B.W. Watson","year":"2003","unstructured":"Watson, B.W., Watson, R.E.: A new family of string pattern matching algorithms. South African Computer Journal\u00a030, 34\u201341 (2003); for rapid access, A reprint of this article appears on \n                  \n                    www.fastar.org\n                  \n                  \n                . This journal remains the appropriate citation reference","journal-title":"South African Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:33:51Z","timestamp":1620120831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}