{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:57:21Z","timestamp":1783011441242,"version":"3.54.6"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1007\/bf01185427","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T16:12:30Z","timestamp":1108743150000},"page":"247-267","source":"Crossref","is-referenced-by-count":124,"title":["Speeding up two string-matching algorithms"],"prefix":"10.1007","volume":"12","author":[{"given":"M.","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Czumaj","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Gasieniec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Jarominek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Lecroq","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"W.","family":"Plandowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"W.","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01185427_CR1","first-page":"255","volume-title":"Handbook of Theoretical Computer Science, vol. A","author":"A. V. Aho","year":"1990","unstructured":"A. V. Aho, Algorithms for finding patterns in strings, inHandbook of Theoretical Computer Science, vol. A (J. van Leeuwen, ed.), Elsevier, Amsterdam, 1990, pp. 255\u2013300."},{"key":"BF01185427_CR2","series-title":"NATO Advanced Science Institutes, Series F","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"A. Apostolico, The myriad virtues of suffix trees, inCombinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.), NATO Advanced Science Institutes, Series F, vol. 12, Springer-Verlag, Berlin, 1985, pp. 85\u201396."},{"key":"BF01185427_CR3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0215007","volume":"15","author":"A. Apostolico","year":"1986","unstructured":"A. Apostolico and R. Giancarlo, The Boyer-Moore-Galil string searching strategies revisited,SIAM J. Comput. 15 (1986), 98\u2013105.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"BF01185427_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(92)90133-Z","volume":"92","author":"R. A. Baeza-Yates","year":"1992","unstructured":"R. A. Baeza-Yates and M. R\u00e9gnier, Average running time of the Boyer-Moore-Horspool algorithm,Theoret. Comput. Sci. 92(1) (1992), 19\u201331.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01185427_CR5","volume-title":"Analysis of Algorithms and Data Structures","author":"L. Banachowski","year":"1991","unstructured":"L. Banachowski, A. Kreczmar, and W. Rytter,Analysis of Algorithms and Data Structures, Addison-Wesley, Reading, MA, 1991."},{"key":"BF01185427_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M. T. Chen, and J. Seiferas, The smallest automaton recognizing the subwords of a text,Theoret. Comput. Sci. 40 (1985), 31\u201355.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01185427_CR7","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. S. Boyer","year":"1977","unstructured":"R. S. Boyer and J. S. Moore, A fast string searching algorithm,Comm. ACM 20 (1977), 762\u2013772.","journal-title":"Comm. ACM"},{"key":"BF01185427_CR8","unstructured":"R. Cole, Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm,Proceedings of the 2nd Annual ACM Symposium on Discrete Algorithms, 1990, pp. 224\u2013233."},{"key":"BF01185427_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"M. Crochemore, Transducers and repetitions,Theoret. Comput. Sci. 45 (1986), 63\u201386.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01185427_CR10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/359146.359148","volume":"22","author":"Z. Galil","year":"1979","unstructured":"Z. Galil, On improving the worst case running time of the Boyer-Moore string searching algorithm,Comm. ACM 22 (1979), 505\u2013508.","journal-title":"Comm. ACM"},{"key":"BF01185427_CR11","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1137\/0209051","volume":"9","author":"L. J. Guibas","year":"1980","unstructured":"L. J. Guibas and A. M. Odlyzko, A new proof of the linearity of the Boyer-Moore string searching algorithm,SIAM J. Comput. 9 (1980), 672\u2013682.","journal-title":"SIAM J. Comput."},{"key":"BF01185427_CR12","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R. N. Horspool","year":"1980","unstructured":"R. N. Horspool, Practical fast searching in strings,Software\u2014Practice and Experience,10 (1980), 501\u2013506.","journal-title":"Software\u2014Practice and Experience"},{"issue":"11","key":"BF01185427_CR13","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1002\/spe.4380211105","volume":"21","author":"A. Hume","year":"1991","unstructured":"A. Hume and D. M. Sunday, Fast string searching,Software\u2014Practice and Experience 21(11) (1991), 1221\u20131248.","journal-title":"Software\u2014Practice and Experience"},{"key":"BF01185427_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"D. E. Knuth, J. H. Morris Jr and V. R. Pratt, Fast pattern matching in strings,SIAM J. Comput. 6 (1977), 323\u2013350.","journal-title":"SIAM J. Comput."},{"key":"BF01185427_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(92)90139-7","volume":"92","author":"T. Lecroq","year":"1992","unstructured":"T. Lecroq, A variation on Boyer-Moore algorithm,Theoret. Comput. Sci. 92 (1992), 119\u2013144.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01185427_CR16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1137\/0209037","volume":"9","author":"W. Rytter","year":"1980","unstructured":"W. Rytter, A correct preprocessing algorithm for Boyer-Moore string searching,SIAM J. Comput. 9 (1980), 509\u2013512.","journal-title":"SIAM J. Comput."},{"key":"BF01185427_CR17","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0208029","volume":"8","author":"A. C. Yao","year":"1979","unstructured":"A. C. Yao, The complexity of pattern matching for a random string,SIAM J. Comput. 8 (1979), 368\u2013387.","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185427.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185427\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:41:38Z","timestamp":1556728898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":17,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["BF01185427"],"URL":"https:\/\/doi.org\/10.1007\/bf01185427","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}