{"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":1725550634475},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_28","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"246-255","source":"Crossref","is-referenced-by-count":0,"title":["Faster Generation of Super Condensed Neighbourhoods Using Finite Automata"],"prefix":"10.1007","author":[{"given":"Lu\u00eds M. S.","family":"Russo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arlindo L.","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"IFIP Transactions","first-page":"465","volume-title":"IFIP Congress (1)","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A.: Text-retrieval: Theory and practice. In: van Leeuwen, J. (ed.) IFIP Congress (1). IFIP Transactions, vol.\u00a0A-12, pp. 465\u2013476. North-Holland, Amsterdam (1992)"},{"issue":"10","key":"28_CR2","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"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Combinatorial Pattern Matching","author":"R.A. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Navarro, G.: A faster algorithm for approximate string matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 1\u201323. Springer, Heidelberg (1996)"},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00009253","volume":"23","author":"R.A. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R.A., Navarro, G.: Faster approximate string matching. Algorithmica\u00a023(2), 127\u2013158 (1999)","journal-title":"Algorithmica"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-60044-2_33","volume-title":"Combinatorial Pattern Matching","author":"A.L. Cobbs","year":"1995","unstructured":"Cobbs, A.L.: Fast approximate matching using suffix trees. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 41\u201354. Springer, Heidelberg (1995)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-39984-1_26","volume-title":"String Processing and Information Retrieval","author":"H. Hyyr\u00f6","year":"2003","unstructured":"Hyyr\u00f6, H., Navarro, G.: A practical index for genome searching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 341\u2013349. Springer, Heidelberg (2003)"},{"key":"28_CR7","unstructured":"Hyyr\u00f6, H.: Practical Methods for Approximate String Matching. PhD thesis, Faculty of Information of the University of Tampere (2003)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-30213-1_28","volume-title":"String Processing and Information Retrieval","author":"H. Hyyr\u00f6","year":"2004","unstructured":"Hyyr\u00f6, H.: An improvement and an extension on the hybrid index for approximate string matching. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 208\u2013209. Springer, Heidelberg (2004)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Myers, E.: A sublinear algorithm for approximate keyword matching. Algorithmica\u00a0(12), 345\u2013374 (1994)","DOI":"10.1007\/BF01185432"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0030777","volume-title":"Combinatorial Pattern Matching","author":"G. Myers","year":"1998","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 1\u201313. Springer, Heidelberg (1998)"},{"issue":"1","key":"28_CR11","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"},{"issue":"1","key":"28_CR12","first-page":"205","volume":"1","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Baeza-Yates, R.: A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms\u00a01(1), 205\u2013239 (2000)","journal-title":"Journal of Discrete Algorithms"},{"issue":"4","key":"28_CR13","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin\u00a024(4), 19\u201327 (2001)","journal-title":"IEEE Data Engineering Bulletin"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/11496656_10","volume-title":"Combinatorial Pattern Matching","author":"L.M.S. Russo","year":"2005","unstructured":"Russo, L.M.S., Oliveira, A.L.: An efficient algorithm for generating super condensed neighborhoods. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 104\u2013115. Springer, Heidelberg (2005)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.: Finding approximate patterns in strings. Journal of Algorithms, 132\u2013137 (1985)","DOI":"10.1016\/0196-6774(85)90023-9"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/BFb0029808","volume-title":"Combinatorial Pattern Matching","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E.: Approximate string-matching over suffix trees. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 228\u2013242. Springer, Heidelberg (1993)"},{"issue":"10","key":"28_CR17","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"},{"key":"28_CR18","unstructured":"File 20ng-train-all-terms, from http:\/\/www.gia.ist.utl.pt\/~acardoso\/datasets"}],"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_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:03Z","timestamp":1605643083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11575832_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}