{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:16Z","timestamp":1759638496069},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_42","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"376-387","source":"Crossref","is-referenced-by-count":22,"title":["Practical and Optimal String Matching"],"prefix":"10.1007","author":[{"given":"Kimmo","family":"Fredriksson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Grabowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"42_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"issue":"10","key":"42_CR2","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. Commun. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"issue":"2\u20134","key":"42_CR3","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jda.2004.08.005","volume":"3","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., Iliopoulos, C., Navarro, G., Pinzon, Y., Salinger, A.: Bit-parallel (\u03b4,\u03b3)-matching suffix automata. Journal of Discrete Algorithms (JDA)\u00a03(2\u20134), 198\u2013214 (2005)","journal-title":"Journal of Discrete Algorithms (JDA)"},{"key":"42_CR4","volume-title":"Text algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-30213-1_8","volume-title":"String Processing and Information Retrieval","author":"L. He","year":"2004","unstructured":"He, L., Fang, B.: Linear nondeterministic dawg string matching algorithm. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 70\u201371. Springer, Heidelberg (2004)"},{"key":"42_CR6","unstructured":"Holub, J., Durian, B.: Fast variants of bit parallel approach to suffix automata. In: Talk given in The Second Haifa Annual International Stringology Research Workshop of the Israeli Science Foundation (2005), \n                    \n                      http:\/\/www.cri.haifa.ac.il\/events\/2005\/string\/presentations\/Holub.pdf"},{"issue":"6","key":"42_CR7","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Softw. Pract. Exp.\u00a010(6), 501\u2013506 (1980)","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"42_CR8","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., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(1), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"42_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1002\/spe.411","volume":"31","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: NR-grep: a fast and flexible pattern matching tool. Softw. Pract. Exp.\u00a031, 1265\u20131312 (2001)","journal-title":"Softw. Pract. Exp."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA)\u00a05(4) (2000), \n                    \n                      http:\/\/www.jea.acm.org\/2000\/NavarroString","DOI":"10.1145\/351827.384246"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-39984-1_7","volume-title":"String Processing and Information Retrieval","author":"H. Peltola","year":"2003","unstructured":"Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 80\u201393. Springer, Heidelberg (2003)"},{"issue":"8","key":"42_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"D.M. Sunday","year":"1990","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Commun. ACM\u00a033(8), 132\u2013142 (1990)","journal-title":"Commun. ACM"},{"key":"42_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-60313-1_153","volume-title":"Algorithms - ESA \u201995","author":"E. Sutinen","year":"1995","unstructured":"Sutinen, E., Tarhio, J.: On using q-gram locations in approximate string matching. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 327\u2013340. Springer, Heidelberg (1995)"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","first-page":"236","volume-title":"Algorithms and Computation","author":"T. Takaoka","year":"1994","unstructured":"Takaoka, T.: Approximate pattern matching with samples. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 236\u2013242. Springer, Heidelberg (1994)"},{"issue":"10","key":"42_CR16","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. Commun. ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Commun. ACM"},{"issue":"3","key":"42_CR17","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0208029","volume":"8","author":"A.C. Yao","year":"1979","unstructured":"Yao, A.C.: The complexity of pattern matching for a random string. SIAM J. Comput.\u00a08(3), 368\u2013387 (1979)","journal-title":"SIAM J. Comput."}],"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_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:59Z","timestamp":1619505779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11575832_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}