{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:14Z","timestamp":1725550634363},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_44","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T10:12:50Z","timestamp":1129198370000},"page":"399-404","source":"Crossref","is-referenced-by-count":5,"title":["A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching"],"prefix":"10.1007","author":[{"given":"Ping","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan-bing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian-long","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in StringsPractical on-line search algorithms for texts and biological sequences, pp. 15-17,74\u201376. Camedge University Press (2002), ISBN 0\u2013521\u201381307\u20137"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast Pattern Matching in Strings. SIAM Journal on Computing, 323\u2013350 (1977)","DOI":"10.1137\/0206024"},{"issue":"6","key":"44_CR3","doi-asserted-by":"publisher","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. Communication of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communication of the ACM"},{"issue":"10","key":"44_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching allowing errors. Communications of the ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Communications of the ACM"},{"issue":"10","key":"44_CR5","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"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-09510-1_10","volume-title":"Automata, Languages, and Programming","author":"B. Commentz-Walter","year":"1979","unstructured":"Commentz-Walter, B.: A string matching algorithm fast on the average. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol.\u00a071, pp. 118\u2013132. Springer, Heidelberg (1979)"},{"key":"44_CR7","unstructured":"Wu, S., Manber, U.: A fast algorithm for multi-pattern searching. Report TR\u201394\u201317, Department of Computer Science, University of Arizona,Tucson, AZ,1994"},{"issue":"4\/5","key":"44_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Gasienniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two string matching algorithms. Algorithmica\u00a012(4\/5), 247\u2013267 (1994)","journal-title":"Algorithmica"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-48194-X_5","volume-title":"Combinatorial Pattern Matching","author":"C. Allauzen","year":"2001","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Efficient experimental string matching by weak factor recognition. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 51\u201372. Springer, Heidelberg (2001)"},{"issue":"3","key":"44_CR10","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., McConnel, R.: Complete inverted files for efficient text retrieval and analysis. Jonual of the ACM\u00a034(3), 578\u2013595 (1987)","journal-title":"Jonual of the ACM"},{"key":"44_CR11","unstructured":"Allauzen, C., Raffinot, M.: Factor oracle of a set of words.Technical report 99\u201311, Institute Gaspard-Monge, University de Marne-la-vallee (1999)"},{"key":"44_CR12","unstructured":"Wang, X.: The Design and Analysis of Computer Algorithms. Publishing House of Electronic Industry, Beijing (2001), ISBN 7\u20135053\u20136391\u20133P38\u201381"},{"issue":"2-3","key":"44_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2004.03.058","volume":"321","author":"G. Navarro","year":"2004","unstructured":"Navarro, G., Fredriksson, K.: Average Complexity of Exact and Approximate Multiple String Matching. Theoretical Computer Science (TCS)\u00a0321(2-3), 283\u2013290 (2004)","journal-title":"Theoretical Computer Science (TCS)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:42:59Z","timestamp":1619491379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11575832_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}