{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:56:36Z","timestamp":1648983396253},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425007","type":"print"},{"value":"9783540446880","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44688-5_2","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T13:43:33Z","timestamp":1188308613000},"page":"13-25","source":"Crossref","is-referenced-by-count":7,"title":["The Max-Shift Algorithm for Approximate String Matching"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Mouchard","sequence":"additional","affiliation":[]},{"given":"Yoan J.","family":"Pinzon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. A. Baeza-Yates","year":"1992","unstructured":"R. A. Baeza-Yates and G. H. Gonnet, A new approach to text searching, CACM, Vol 35, (1992), pp. 74\u201382.","journal-title":"CACM"},{"key":"2_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of the 7th Symposium on Combinatorial Pattern Matching","author":"R. A. Baeza-Yates","year":"1996","unstructured":"R. A. Baeza-Yates and G. Navarro, A faster algorithm for approximate string matching, in Proceedings of the 7th Symposium on Combinatorial Pattern Matching, LNCS, Vol. 1075, Springer-Verlag, New York, (1996), pp. 1\u201323."},{"key":"2_CR3","unstructured":"R. A. Baeza-Yates and G. Navarro, Analysis for algorithm engineering: Improving an algorithm for approximate pattern matching. Unpublished manuscript."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/0219067","volume":"19","author":"Z. Galil","year":"1990","unstructured":"Z. Galil and K. Park, An improved algorithm for approximate string matching, SI AM Journal on Computing, 19 (1990), pp. 989\u2013999.","journal-title":"SI AM Journal on Computing"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/356827.356830","volume":"12","author":"P. A. Hall","year":"1980","unstructured":"P. A. Hall and G. R. Dowling, Approximate string matching, Computing Surveys, Vol 12, (1980), pp. 381\u2013402.","journal-title":"Computing Surveys"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J. W. Hunt","year":"1977","unstructured":"J. W. Hunt and T. G. Szymanski, An algorithm for differential file comparison, Comm. of the ACM, Vol 20, (1977), pp. 350\u2013353.","journal-title":"Comm. of the ACM"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"G. M. Landau","year":"1998","unstructured":"G. M. Landau, E. Myers and J. P. Schmidt, Incremental string comparison, SIAM Journal on Computing 27,2 (1998), 557\u2013582.","journal-title":"SIAM Journal on Computing"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G. M. Landau","year":"1988","unstructured":"G. M. Landau and U. Vishkin, Fast string matching with k differences, Journal of Computer and Systems Sciences, 37 (1988), pp. 63\u201378.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90109-B","volume":"35","author":"M. Maes","year":"1990","unstructured":"M. Maes, On a cyclic string-to-string correction problem, in Info. Proc. Lett., Vol. 35, (1990), pp. 73\u201378.","journal-title":"Info. Proc. Lett."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W. J. Masek","year":"1980","unstructured":"W. J. Masek and M. S. Paterson, A Fast algorithm for computing string edit distances. in J. Comput. Sy. Sci., Vol. 20, (1980), pp. 18\u201331.","journal-title":"J. Comput. Sy. Sci."},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"E. W. Myers","year":"1999","unstructured":"E. W. Myers, A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Progamming, in Journal of the ACM 46,3 (1999) pp. 395\u2013415.","journal-title":"Journal of the ACM"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. B. Needleman","year":"1970","unstructured":"S. B. Needleman and C. D. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of the two proteins, in J. of Mol. Bio., Vol 48 (1970), pp. 443\u2013453.","journal-title":"J. of Mol. Bio."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P.H. Seller","year":"1980","unstructured":"P.H. Seller, The theory and computation of evolutionary distances: Pattern recognition, in Journal of Algorithms, Vol 1, (1980), pp. 359\u2013373.\u00e0.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. F. Smith","year":"1981","unstructured":"T. F. Smith and M. S. Waterman, Identification of common molecular subsequences, in Journal of Molecular Biology, Vol 147, No. 2 (1981), pp. 195\u2013197.","journal-title":"Journal of Molecular Biology"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen, Finding approximate patterns in strings, in J. of Algorithms, Vol 6, (1985), pp. 132\u2013137.","journal-title":"J. of Algorithms"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. A. Wangner","year":"1974","unstructured":"R. A. Wangner and M. J. Fischer, The string-to-string correction problem, in J. of the ACM, Vol 21, No. 1 (1974), pp. 168\u2013173.","journal-title":"J. of the ACM"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/spe.4380240402","volume":"24","author":"A. H. Wright","year":"1994","unstructured":"A. H. Wright, Approximate string matching using within-word parallelism. in Soft. Pract. Exper., Vol 24, (1994), pp. 337\u2013362.","journal-title":"Soft. Pract. Exper."},{"key":"2_CR18","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, CACM, Vol 35, (1992), pp. 83\u201391.","journal-title":"CACM"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF01942606","volume":"15","author":"S. Wu","year":"1996","unstructured":"S. Wu, U. Manber and G. Myers, A subquadratic algorithm for approximate limited expression matching, in Algorithmica, Vol. 15, (1996), pp. 50\u201367.","journal-title":"Algorithmica"}],"container-title":["Algorithm Engineering","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44688-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T09:07:31Z","timestamp":1550912851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44688-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425007","9783540446880"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-44688-5_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}