{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:15Z","timestamp":1725664215245},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612582"},{"type":"electronic","value":"9783540683902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61258-0_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:20:42Z","timestamp":1330291242000},"page":"24-38","source":"Crossref","is-referenced-by-count":5,"title":["Boyer-Moore strategy to efficient approximate string matching"],"prefix":"10.1007","author":[{"given":"Nadia","family":"El-Mabrouk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson. Generalized string matching. SIAM J. Comput., 16(6):1039\u20131051, December 1987.","journal-title":"SIAM J. Comput."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18:333\u2013340, 1975.","journal-title":"Commun. ACM"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"T. Akutsu. Approximate string matching with don't care characters. In M. Crochemore and D. Gusfield, editors, Lecture Notes in Computer Science, volume 807 of Combinatorial Pattern Matching (5th Annual Symposium, CPM94), pages 229\u2013242. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58094-8_21"},{"key":"2_CR4","unstructured":"R. Baeza-Yates and G. H. Gonnet. Fast string matching with k mismatches. Technical Report CS-88-36, Data Structuring Group, September 1988."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates and G. H. Gonnet. Efficient text searching of regular expressions. 16th International colloquium on Automata, Languages and Programming. Stresa, Italy, July 1989.","DOI":"10.1007\/BFb0035751"},{"issue":"10","key":"2_CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"R. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Commun. ACM, 35(10):74\u201382, October 1992.","journal-title":"Commun. ACM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates and C. H. Perleberg. Fast and practical approximate string matching. In Lecture Notes in Computer Science, volume 644 of Combinatorial Pattern Matching (3 th Annual Symposium, CPM92), pages 185\u2013191. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56024-6_15"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/jpdc.1994.1083","volume":"22","author":"A. A. Bertossi","year":"1994","unstructured":"A. A. Bertossi and F. Logi. Parallel string matching with variable length don't cares. Journal of parallel and distributed computing, 22:229\u2013234, 1994.","journal-title":"Journal of parallel and distributed computing"},{"issue":"10","key":"2_CR9","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. Commun. ACM, 20(10):762\u2013772, October 1977.","journal-title":"Commun. ACM"},{"key":"2_CR10","first-page":"113","volume-title":"Complexity of Computation (SIAM-AMS Proceedings 7), volume 7","author":"M. J. Fischer","year":"1974","unstructured":"M. J. Fischer and M. S. Paterson. String-matching and other products. In R. Karp, editor, Complexity of Computation (SIAM-AMS Proceedings 7), volume 7, pages 113\u2013125. American Mathematical Society, Providence, R.I., 1974."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/8307.8309","volume":"17","author":"Z. Galil","year":"1986","unstructured":"Z. Galil and R. Giancarlo. Improved string matching with k mismatches. SIGACT News, 17:52\u201354, 1986.","journal-title":"SIGACT News"},{"issue":"33","key":"2_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(89)90188-9","volume":"3","author":"R. Grossi","year":"1989","unstructured":"R. Grossi and F. Luccio. Simple and efficient string matching with k mismatches. Inf. Proc. Letters, 3(33):113\u2013120, November 1989.","journal-title":"Inf. Proc. Letters"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"D. E. Knuth, J. H. Morris, and V. Pratt. Fast pattern matching in strings. SIAM J. Comput., 6:323\u2013350, June 1977.","journal-title":"SIAM J. Comput."},{"key":"2_CR14","first-page":"230","volume-title":"Lecture Notes in Computer Science","author":"G. Kucherov","year":"1995","unstructured":"G. Kucherov and M. Rusinowitch. Matching a set of strings with variable length don't cares. In Z. Galil and E. Ukkonen, editors, Lecture Notes in Computer Science, volume 937 of 6th annual symposium, CPM95, pages 230\u2013247. Espoo,Finland, Springer, July 1995."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"G. M. Landau","year":"1986","unstructured":"G. M. Landau and U. Vishkin. Efficient string matching with k mismatches. Theoret. Comput. Sci., (43):239\u2013249, 1986.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(91)90032-D","volume":"37","author":"U. Manber","year":"1991","unstructured":"U. Manber and R. Baeza-Yates. An algorithm for string matching with a sequence of don't cares. Information Proceeding Letters, 37:133\u2013136, 1991.","journal-title":"Information Proceeding Letters"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"R. Y. Pinter. Efficient string matching whith don't-care patterns. In A. Apostolico and E.-V. Z. Galil, editors, Combinatorial Algorithms on Words, volume F12, pages 11\u201329. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_2"},{"key":"2_CR18","first-page":"348","volume-title":"Lecture Notes in Computer Science","author":"J. Tarhio","year":"1990","unstructured":"J. Tarhio and E. Ukkonen. Boyer-moore approach to approximate string matching. In J. R. Gilbert and R. G. Karlsson, editors, Lecture Notes in Computer Science, volume 447 of 2nd Scandinavian Workshop in Algorithmic Theory, SWAT'90, pages 348\u2013359. Bergen, Norway, Springer-Verlag, July 1990."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"E. Ukkonen. Approximate string-matching over suffix trees. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Lecture Notes in Computer Science, volume 684 of Combinatorial Pattern Matching (4 th Annual Symposium, CPM93), pages 240\u2013249. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0029808"},{"issue":"10","key":"2_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83\u201391, October 1992.","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61258-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:04:42Z","timestamp":1605647082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61258-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612582","9783540683902"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61258-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}