{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:30:14Z","timestamp":1742380214553},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540088608"},{"type":"electronic","value":"9783540358077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_18","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:34:18Z","timestamp":1330169658000},"page":"241-250","source":"Crossref","is-referenced-by-count":8,"title":["On improving the worst case running time of the Boyer-Moore string matching algorithm"],"prefix":"10.1007","author":[{"given":"Zvi","family":"Galil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"10","key":"18_CR1","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/359842.359859","volume":"20","author":"R. S. Boyer","year":"1977","unstructured":"Boyer R.S. and Moore J.S., \"A fast string searching algorithm,\" Communication of the ACM, Vol. 20, No. 10 (1977), 262\u2013272.","journal-title":"Communication of the ACM"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Guibas L.J. and Odlyzko A.M., \"A new proof of the linearity of the Boyer-Moore string searching algorithms,\" Proceedings 18th Annual IEEE Symposium on Foundations of Computer Science (1977), 189\u2013195.","DOI":"10.1109\/SFCS.1977.3"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"Knuth D.E., Morris Jr. J.H. and Pratt V.B., \"Fast pattern matching in strings\", SIAM J. on Computing, Vol. 6, No. 2, (1977), 323\u2013350.","journal-title":"SIAM J. on Computing"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R. C. Lyndon","year":"1962","unstructured":"Lyndon R.C. and Schutzenberger M.P., \"The equation aM=bNcP in a free group,\" Michigan Math. J., 9 (1962), 289\u2013298.","journal-title":"Michigan Math. J."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"McCreight E.M., \"A space economical suffix tree construction algorithm,\" Journal of the ACM, Vol. 23, No. 2 (1976), 262\u2013272.","journal-title":"Journal of the ACM"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Weiner P., \"Linear pattern matching algorithm,\" Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory (1973), 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"key":"18_CR7","volume-title":"The complexity of pattern matching for a random string","author":"A. C. C. C. Yao","year":"1977","unstructured":"Yao A.C.C., \"The complexity of pattern matching for a random string,\" manuscript; Computer Science Department, Stanford University, Stanford, Calif. (1977)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:54:54Z","timestamp":1619542494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}