{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:02Z","timestamp":1725664022304},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560241"},{"type":"electronic","value":"9783540473572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56024-6_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:54:12Z","timestamp":1330253652000},"page":"41-51","source":"Crossref","is-referenced-by-count":4,"title":["Fast multiple keyword searching"],"prefix":"10.1007","author":[{"given":"Jong Yong","family":"Kim","sequence":"first","affiliation":[]},{"given":"John","family":"Shawe-Taylor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"A.V. Aho: Algorithms for finding patterns in strings, Handbook of theoretical computer science. Vol A edited by J.van Leewen (1990) Elsevier 257\u2013300.","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/360825.360849","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"A.V. Aho and Margaret J. Corasick: Efficient String Matching: An Aid to Bibliographic Search. Comm. ACM 18 (1975) 330\u2013340.","journal-title":"Comm. ACM"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"R.A. Baeza-Yates: Fast algorithms for two dimensional and multiple pattern matching. Springer-Verlag LNCS 447 SWAT90 332\u2013347.","DOI":"10.1007\/3-540-52846-6_102"},{"key":"4_CR4","unstructured":"P. Billingsley: Ergodic Theory and Information. John Wiley and Sons 1965."},{"key":"4_CR5","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. Com. ACM 20 (1977) 762\u2013772.","journal-title":"Com. ACM"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"B. Commentz-Walter: A string matching algorithm fast on the average, Proc 6th international Colloquium on Automata, Languages and programming, Springer-Verlag (1979) 118\u2013132.","DOI":"10.1007\/3-540-09510-1_10"},{"key":"4_CR7","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 searhing in strings. Software practice and experience 10 (1980) 501\u2013506.","journal-title":"Software practice and experience"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(92)90138-6","volume":"92","author":"J.Y. Kim","year":"1992","unstructured":"J.Y. Kim and J. Shawe-Taylor: An Approximate String Matching Algorithm. Theoretical Computer Science 92 (1992) 107\u2013117.","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","unstructured":"J.Y. Kim and J. Shawe-Taylor: Fast Expected String Matching using an n-gram Algorithm. Departmental Technical Report CSD-TR-91-16."},{"key":"4_CR10","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 and V.R. Pratt: Fast Pattern Matching in strings. SIAM. J. Comput. 6 (1977) 323\u2013350.","journal-title":"SIAM. J. Comput."},{"key":"4_CR11","unstructured":"J. Shawe-Taylor: Fast String Matching in a Stationary Ergodic Source. Departmental Technical Report CSD-TR-633."},{"key":"4_CR12","unstructured":"J. Shawe-Taylor and J.Y. Kim: Fast Two dimensional Pattern Matching. Departmental Technical Report CSD-TR-91-25."},{"key":"4_CR13","unstructured":"D. Welsh: Codes and Cryptography. Oxford University Press (1988)."},{"key":"4_CR14","unstructured":"S. Wu and U. Manber: Fast Text Searching With Errors. Department of Computer Science TR91-11 Arizona University."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56024-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:42Z","timestamp":1605646962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56024-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560241","9783540473572"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56024-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}