{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:04Z","timestamp":1725558964157},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540250654"},{"type":"electronic","value":"9783540318712"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31871-2_25","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T18:44:29Z","timestamp":1278528269000},"page":"289-300","source":"Crossref","is-referenced-by-count":3,"title":["On Bit-Parallel Processing of Multi-byte Text"],"prefix":"10.1007","author":[{"given":"Heikki","family":"Hyyr\u00f6","sequence":"first","affiliation":[]},{"given":"Jun","family":"Takaba","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"Aho, A., Corasick, M.: Efficient string matching: an aid to bibliographic search. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(86)90091-8","volume":"23","author":"A. Allison","year":"1986","unstructured":"Allison, A., Dix, T.L.: A bit-string longest common subsequence algorithm. Information Processing Letters\u00a023, 305\u2013310 (1986)","journal-title":"Information Processing Letters"},{"issue":"10","key":"25_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"issue":"10","key":"25_CR4","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":"25_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0020-0190(01)00182-X","volume":"80","author":"M. Crochemore","year":"2001","unstructured":"Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters\u00a080, 279\u2013285 (2001)","journal-title":"Information Processing Letters"},{"key":"25_CR6","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"A. Czumaj","year":"1994","unstructured":"Czumaj, A., Crochemore, M., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two string-matching algorithms. Algorithmica\u00a012, 247\u2013267 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"F. Damerau","year":"1964","unstructured":"Damerau, F.: A technique for computer detection and correction of spelling errors. Communications of the ACM\u00a07(3), 171\u2013176 (1964)","journal-title":"Communications of the ACM"},{"key":"25_CR9","unstructured":"Hyyr\u00f6, H.: Explaining and extending the bit-parallel approximate string matching algorithm of Myers. Technical Report A-2001-10, Dept. of Computer and Information Sciences, University of Tampere, Tampere, Finland (2001)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-39984-1_8","volume-title":"String Processing and Information Retrieval","author":"H. Hyyr\u00f6","year":"2003","unstructured":"Hyyr\u00f6, H.: Bit-parallel approximate string matching with transposition. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 95\u2013107. Springer, Heidelberg (2003)"},{"key":"25_CR11","unstructured":"Hyyr\u00f6, H.: Bit-parallel LCS-length computation revisited. In: Proc. 15th Australasian Workshop on Combinatorial Algorithms, AWOCA 2004 (2004)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-45452-7_18","volume-title":"Combinatorial Pattern Matching","author":"H. Hyyr\u00f6","year":"2002","unstructured":"Hyyr\u00f6, H., Navarro, G.: Faster bit-parallel approximate string matching. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, p. 203. Springer, Heidelberg (2002)"},{"issue":"1","key":"25_CR13","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 Journal on Computing\u00a06(1), 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"8","key":"25_CR14","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady\u00a010(8), 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G. Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM\u00a046(3), 395\u2013415 (1999)","journal-title":"Journal of the ACM"},{"issue":"1","key":"25_CR16","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":"25_CR17","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. Software Practice and Experience\u00a031, 1265\u20131312 (2001)","journal-title":"Software Practice and Experience"},{"key":"25_CR18","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 Algorithms\u00a05(4) (2000)","DOI":"10.1145\/351827.384246"},{"key":"25_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge (2002)"},{"issue":"3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1093\/llc\/8.3.143","volume":"8","author":"A.M. Robertson","year":"1993","unstructured":"Robertson, A.M., Willett, P.: A comparison of spelling-correction methods for the identification of word forms in historical text databases. Literary and Linguistic Computing\u00a08(3), 143\u2013152 (1993)","journal-title":"Literary and Linguistic Computing"},{"volume-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1983","key":"25_CR21","unstructured":"Sankoff, D., Kruskal, J. (eds.): Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading (1983)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45735-6_16","volume-title":"String Processing and Information Retrieval","author":"M. Takeda","year":"2002","unstructured":"Takeda, M., Miyamoto, S., Kida, T., Shinohara, A., Fukumachi, S., Shinohara, T., Arikawa, S.: Processing text files as is: Pattern matching over compressed tests, multi-byte character texts, and semi-structured tests. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, p. 170. Springer, Heidelberg (2002)"},{"key":"25_CR23","unstructured":"Unicode Consortium.: Unicode Home Page, http:\/\/www.unicode.org\/"},{"key":"25_CR24","unstructured":"Unicode Consortium.: The Unicode Standard 4.0. Addison-Wesley (2003)"},{"issue":"1","key":"25_CR25","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF01942606","volume":"15","author":"S. Wu","year":"1996","unstructured":"Wu, S., Manber, U., Myers, E.: A sub-quadratic algorithm for approximate limited expression matching. Algorithmica\u00a015(1), 50\u201367 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Information Retrieval Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31871-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:30:21Z","timestamp":1605760221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31871-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540250654","9783540318712"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31871-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}