{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:53Z","timestamp":1725493433598},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_16","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"157-167","source":"Crossref","is-referenced-by-count":0,"title":["On String Matching in Chunked Texts"],"prefix":"10.1007","author":[{"given":"Hannu","family":"Peltola","sequence":"first","affiliation":[]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/spe.4380190305","volume":"19","author":"R. Baeza-Yates","year":"1989","unstructured":"Baeza-Yates, R.: Improved string searching. Software: Practice and Experience\u00a019(3), 257\u2013271 (1989)","journal-title":"Software: Practice and Experience"},{"key":"16_CR2","unstructured":"Berry, T., Ravindran, S.: A fast string matching algorithm and experimental results. In: Proc. of the Prague Stringology Club Workshop 1999, Czech Technical University, Prague, Czech Republic, Collaborative Report DC-99-05, pp. 16\u201328 (1999)"},{"issue":"10","key":"16_CR3","doi-asserted-by":"publisher","first-page":"762","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), 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"issue":"6","key":"16_CR4","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: Practice and Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software: Practice and Experience"},{"issue":"11","key":"16_CR5","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: Practice and Experience\u00a021(11), 1221\u20131248 (1991)","journal-title":"Software: Practice and Experience"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/spe.4380240105","volume":"24","author":"J.Y. Kim","year":"1994","unstructured":"Kim, J.Y., Shawe-Taylor, J.: Fast string matching using an n-gram algorithm. Software: Practice and Experience\u00a024(1), 79\u201388 (1994)","journal-title":"Software: Practice and Experience"},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1002\/(SICI)1097-024X(19980425)28:5<561::AID-SPE170>3.0.CO;2-W","volume":"28","author":"T. Lecroq","year":"1998","unstructured":"Lecroq, T.: Experiments on string matching in memory structures. Software: Practice and Experience\u00a028(5), 561\u2013568 (1998)","journal-title":"Software: Practice and Experience"},{"key":"16_CR8","doi-asserted-by":"crossref","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)"},{"issue":"10","key":"16_CR9","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1002\/spe.4380221006","volume":"22","author":"T. Raita","year":"1992","unstructured":"Raita, T.: Tuning the Boyer\u2013Moore\u2013Horspool string searching algorithm. Software: Practice and Experience\u00a022(10), 879\u2013884 (1992)","journal-title":"Software: Practice and Experience"},{"issue":"8","key":"16_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"D.M. Sunday","year":"1990","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Communications of the ACM\u00a033(8), 132\u2013142 (1990)","journal-title":"Communications of the ACM"},{"issue":"3","key":"16_CR11","first-page":"173","volume":"10","author":"R.F. Zhu","year":"1987","unstructured":"Zhu, R.F., Takaoka, T.: On improving the average case of the Boyer\u2013Moore string matching algorithm. Journal of Information Processing\u00a010(3), 173\u2013177 (1987)","journal-title":"Journal of Information Processing"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:06Z","timestamp":1619520486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_16","relation":{},"subject":[]}}