{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:51:33Z","timestamp":1773388293257,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223412","type":"print"},{"value":"9783540278016","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_33","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"434-444","source":"Crossref","is-referenced-by-count":18,"title":["Approximate String Matching Using Compressed Suffix Arrays"],"prefix":"10.1007","author":[{"given":"Trinh N. D.","family":"Huynh","sequence":"first","affiliation":[]},{"given":"Wing-Kai","family":"Hon","sequence":"additional","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"Boyer, R., Moore, S.: A fast string matching algorithm. CACM\u00a020, 762\u2013772 (1977)","journal-title":"CACM"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J., Pratt, V.: Fast pattern matching in strings. SAIM Journal on Computing\u00a06, 323\u2013350 (1977)","journal-title":"SAIM Journal on Computing"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms \u00a010, 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"key":"33_CR4","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 794\u2013803 (2000)"},{"key":"33_CR5","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":"1","key":"33_CR6","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":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. MCreight","year":"1976","unstructured":"MCreight, E.M.: A space economical suffix tree construction algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"issue":"5","key":"33_CR8","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. 41st IEEE Symp. Foundations of Computer Science (FOCS 2000), pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"33_CR11","unstructured":"Shi, F.: Fast Approximate String Matching with q-Blocks Sequences. In: Proceedings of the 3rd South American Workshop on String Processing (WSP 1996), Carleton University Press (1996)"},{"key":"33_CR12","first-page":"273","volume":"1","author":"R.A. Baeza-Yates","year":"1997","unstructured":"Baeza-Yates, R.A., Navarro, G.: A practical index for text retrieval allowing errors. CLEI\u00a01, 273\u2013282 (1997)","journal-title":"CLEI"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45123-4_29","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing text with approximate q-grams. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 350\u2013363. Springer, Heidelberg (2000)"},{"issue":"1","key":"33_CR14","first-page":"205","volume":"1","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Baeza-Yates, R.A.: A hybrid indexing method for approximate string matching. J. of Discrete Algorithms\u00a01(1), 205\u2013239,18 (2000)","journal-title":"J. of Discrete Algorithms"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-61258-0_4","volume-title":"Combinatorial Pattern Matching","author":"E. Sutinen","year":"1996","unstructured":"Sutinen, E.: J. Tarhio Filtration with q-Samples in Approximate String Matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 50\u201363. Springer, Heidelberg (1996)"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Cobbs, A.: Fast Approximate Matching using Suffix Trees. In: Proc. 6th Ann. Symp. on Combinatorial Pattern Matching (CPM 1995). LNCS, vol.\u00a0807, pp. 41\u201354 (1995)","DOI":"10.1007\/3-540-60044-2_33"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48447-7_19","volume-title":"Algorithms and Data Structures","author":"A. Amir","year":"1999","unstructured":"Amir, A., Keselman, D., Landau, G.M., Lewenstein, M., Lewenstein, N., Rodeh, M.: Indexing and dictionary matching with one error. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 181\u2013192. Springer, Heidelberg (1999)"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45253-2_12","volume-title":"Algorithms - ESA 2000","author":"A.L. Buchsbaum","year":"2000","unstructured":"Buchsbaum, A.L., Goodrich, M.T., Westbrook, J.R.: Range searching over tree cross products. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 120\u2013131. Springer, Heidelberg (2000)"},{"key":"33_CR19","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 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)"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-48452-3_13","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"1999","unstructured":"Navarro, G., Baeza-Yates, R.: A new indexing method for approximate string matching. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 163\u2013185. Springer, Heidelberg (1999)"},{"key":"33_CR21","first-page":"175","volume":"12","author":"K. Sadakane","year":"2001","unstructured":"Sadakane, K., Shibuya, T.: Indexing Huge Genome Sequences for Solving Various Problems. Genome Informatics\u00a012, 175\u2013183 (2001)","journal-title":"Genome Informatics"},{"key":"33_CR22","unstructured":"Hon, W.K., Sadakane, K., Sung, W.K.: Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. In: Proc. of IEEE Symposium on Foundations of Computer Science (2003)"},{"key":"33_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"33_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-54345-7_67","volume-title":"Mathematical Foundations of Computer Science 1991","author":"P. Jokinen","year":"1991","unstructured":"Jokinen, P., Ukkonen, E.: Two algorithms for approximate string matching in static texts. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 240\u2013248. Springer, Heidelberg (1991)"},{"issue":"4","key":"33_CR25","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":"33_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.-K. Kim","year":"2003","unstructured":"Kim, D.-K., Sim, J.S., Park, H.-J., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space Efficient Linear Time Construction of Suffix Arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:57Z","timestamp":1620012417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}