Indexing variable length substrings for exact and approximate matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5721 LNCS, Issue , 2009, Pages 214-221

  Navarro, Gonzalo ^a   Salmela, Leena ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MATCHING; NEW INDICES; NEW STRUCTURES; Q-GRAM INDICES; Q-GRAMS; SUB-STRINGS; SUFFIX-TREES; VARIABLE LENGTH;

INFORMATION SERVICES; TOWERS;

INFORMATION RETRIEVAL;

EID: 70350635615     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03784-9_21     Document Type: Conference Paper

References (13)

1. Baeza-Yates, R., Navarro, G.: Faster approximate string matching. Algorithmica 23(2), 127-158 (1999)
2. Baeza-Yates, R., Perleberg, C.: Fast and practical approximate string matching. Information Processing Letters 59(1), 21-27 (1996)
3. Holsti, N., Sutinen, E.: Approximate string matching using q-gram places. In: Proc. Finnish Symp. on Computer Science, pp. 23-32. University of Joensuu (1994)
4. Jokinen, P., Ukkonen, E.: Two algorithms for approximate string matching in static texts. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol. 520, pp. 240-248. Springer, Heidelberg (1991)
5. Klein, S.T., Shapira, D.: Improved variable-to-fixed length codes. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 39-50. Springer, Heidelberg (2008)
6. Manber, U., Myers, G.: Suffix arrays: A new method for online string searches. SIAM Journal on Computing 22(5), 935-948 (1993)
7. Navarro, G., Baeza-Yates, R.: A practical q-gram index for text retrieval allowing errors. CLEI Electronic Journal 1(2) (1998)
8. Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin 24(4), 19-27 (2001)
9. Navarro, G., Sutinen, E., Tarhio, J.: Indexing text with approximate q-grams. Journal of Discrete Algorithms 3(2-4), 157-175 (2005)
10. Shi, F.: Fast approximate string matching with q-blocks sequences. In: Proc. WSP 1996, pp. 257-271. Carleton University Press (1996)
11. Sutinen, E., Tarhio, J.: On using q-gram locations in approximate string matching. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 327-340. Springer, Heidelberg (1995)
12. Sutinen, E., Tarhio, J.: Filtration with q-samples in approximate string matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 50-63. Springer, Heidelberg (1996)
13. Wu, S., Manber, U.: Fast text searching allowing errors. Communications of the ACM 35(10), 83-91 (1992)