{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T21:51:43Z","timestamp":1771883503485,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf02238127","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T12:36:13Z","timestamp":1131971773000},"page":"119-125","source":"Crossref","is-referenced-by-count":5,"title":["Fast string matching algorithms for run-length coded strings","Schnelle Algorithmen zum Auffinden runl\u00e4ngen-codierter Zeichenketten"],"prefix":"10.1007","volume":"54","author":[{"given":"K. -L.","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02238127_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"Aho, A. V., Corasick, M. J.: Efficient string matching: an aid to bibliographic search. Comm. ACM.18, 333\u2013340 (1975).","journal-title":"Comm. ACM."},{"key":"BF02238127_CR2","volume-title":"Text compression","author":"T. C. Bell","year":"1990","unstructured":"Bell, T. C., Cleary, J. G., Witten, I. H.: Text compression. Englewood Cliffs: Prentice Hall 1990."},{"key":"BF02238127_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02243873","volume":"50","author":"H. Bunke","year":"1993","unstructured":"Bunke, H., Csirik, J.: An algorithm for matching run-length coded strings. Computing50, 297\u2013314 (1993).","journal-title":"Computing"},{"key":"BF02238127_CR4","doi-asserted-by":"crossref","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. Comm. ACM.20, 762\u2013772 (1977).","journal-title":"Comm. ACM."},{"key":"BF02238127_CR5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/00207169208804061","volume":"42","author":"G. H. Chen","year":"1992","unstructured":"Chen, G. H.: AnO(1) time algorithm for string matching. Int. J. Comput. Math.42, 185\u2013191 (1992).","journal-title":"Int. J. Comput. Math."},{"key":"BF02238127_CR6","unstructured":"Chung, K. L.: An improvedO(1) time algorithm for string matching. Research Report, Dept. of Information Mgmt., National Taiwan Institute of Technology, Dec. 1993."},{"key":"BF02238127_CR7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"Z. Galil","year":"1985","unstructured":"Galil, Z.: Optimal parallel algorithms for string matching. Inf. Control67, 144\u2013157 (1985).","journal-title":"Inf. Control"},{"key":"BF02238127_CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. M. Karp","year":"1987","unstructured":"Karp, R. M., Rabin, M. O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev.31, 249\u2013260 (1987).","journal-title":"IBM J. Res. Dev."},{"key":"BF02238127_CR9","doi-asserted-by":"crossref","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 string. SIAM J. Comput.6, 323\u2013350 (1977).","journal-title":"SIAM J. Comput."},{"key":"BF02238127_CR10","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/12.277290","volume":"42","author":"R. Miller","year":"1993","unstructured":"Miller, R., Prasanna-Kumar, V. K., Reisis, D. I., Stout, Q. F.: Parallel computations on reconfigurable meshes. IEEE Trans. Comput.42, 678\u2013692 (1993).","journal-title":"IEEE Trans. Comput."},{"key":"BF02238127_CR11","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/21.17370","volume":"18","author":"J. Rothstein","year":"1988","unstructured":"Rothstein, J.: Bus automata, brains, and mental models. IEEE Trans. Systems Man Cybernet.18, 522\u2013531 (1988).","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"BF02238127_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(85)80028-0","volume":"67","author":"U. Vishkin","year":"1985","unstructured":"Vishkin, U.: Optimal parallel pattern matching in strings. Inf. Control67, 91\u2013113 (1985).","journal-title":"Inf. Control"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238127\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T13:02:25Z","timestamp":1557925345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF02238127"],"URL":"https:\/\/doi.org\/10.1007\/bf02238127","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}