Indexing text with approximate q-grams

Journal of Discrete Algorithms

Volumn 3, Issue 2-4, 2005, Pages 157-175

  Navarro, Gonzalo ^a   Sutinen, Erkki ^b   Tarhio, Jorma ^c  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF EASTERN FINLAND   (Finland)

^c AALTO UNIVERSITY   (Finland)

Author keywords

Approximate string matching; q gram indices; Text databases

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; ERROR ANALYSIS; ONLINE SEARCHING; ONLINE SYSTEMS; PATTERN MATCHING; TREES (MATHEMATICS);

APPROXIMATE STRING MATCHING; ERROR LEVELS; Q-GRAM INDICES; TEXT DATABASES;

ALGORITHMS;

EID: 18544379601     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.003     Document Type: Conference Paper

References (29)

1. A. Apostolico, and Z. Galil Combinatorial Algorithms on Words 1985 Springer-Verlag New York
2. M. Araújo, G. Navarro, and N. Ziviani Large text searching allowing errors Proc. WSP'97 1997 Carleton University Press 2 20
3. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, and J. Seiferas The smallest automaton recognizing the subwords of a text Theoret. Comput. Sci. 40 1985 31 55
4. R. Baeza-Yates Text retrieval: Theory and practice 12th IFIP World Computer Congress, vol. I 1992 Elsevier Science Amsterdam 465 476
5. R. Baeza-Yates, and G. Navarro Faster approximate string matching Algorithmica 23 2 1999 127 158
6. R. Baeza-Yates, and G. Navarro Block-addressing indices for approximate text retrieval J. Amer. Soc. Inform. Sci. (JASIS) 51 1 2000 69 82
7. W. Chang, and T. Marr Approximate string matching and local similarity Proc. CPM'94 Lecture Notes in Comput. Sci. vol. 807 1994 259 273
8. A. Cobbs Fast approximate matching using suffix trees Proc. CPM'95 Lecture Notes in Comput. Sci. vol. 937 1995 41 54
9. M. Crochemore Transducers and repetitions Theoret. Comput. Sci. 45 1986 63 86
10. G. Gonnet, R. Baeza-Yates, and T. Snider New indices for text: Pat trees and Pat arrays Information Retrieval: Data Structures and Algorithms 1992 Prentice-Hall 66 82
11. R. Giegerich, S. Kurtz, and J. Stoye Efficient implementation of lazy suffix trees Proc. WAE'99 Lecture Notes in Comput. Sci. vol. 1668 1999 30 42
12. G. Gonnet, A tutorial introduction to Computational Biochemistry using Darwin, Technical Report, Informatik E.T.H., Zuerich, Switzerland, 1992
13. H. Hyyrö, and G. Navarro Faster bit-parallel approximate string matching Proc. 13th Combinatorial Pattern Matching (CPM'2002) Lecture Notes in Comput. Sci. vol. 2373 2002 203 224
14. N. Holsti, and E. Sutinen Approximate string matching using q-gram places Proc. 7th Finnish Symposium on Computer Science 1994 University of Joensuu 23 32
15. P. Jokinen, and E. Ukkonen Two algorithms for approximate string matching in static texts Proc. of MFCS'91, vol. 16 1991 240 248
16. D. Knuth The Art of Computer Programming Sorting and Searching vol. 3 1973 Addison-Wesley
17. U. Manber, and E. Myers Suffix arrays: a new method for on-line string searches SIAM J. Comput. 1993 935 948
18. U. Manber, and S. Wu glimpse: A tool to search through entire file systems Proc. USENIX Technical Conference 1994 23 32
19. E. Myers A sublinear algorithm for approximate keyword searching Algorithmica 12 4/5 1994 345 374
20. G. Myers A fast bit-vector algorithm for approximate string matching based on dynamic programming J. ACM 46 3 1999 395 415
21. G. Navarro A guided tour to approximate string matching ACM Comput. Surv. 33 1 2001 31 88
22. G. Navarro, and R. Baeza-Yates A practical q-gram index for text retrieval allowing errors CLEI Electronic J. 1 2 1998 http://www.clei.cl
23. G. Navarro, and R. Baeza-Yates A hybrid indexing method for approximate string matching J. Discrete Algorithms (JDA) 1 1 2000 205 239
24. G. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio Indexing text with approximate q-grams Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM'2000) Lecture Notes in Comput. Sci. vol. 1848 2000 350 363
25. P. Sellers The theory and computation of evolutionary distances: pattern recognition J. Algorithms 1 1980 359 373
26. F. Shi Fast approximate string matching with q-blocks sequences Proc. WSP'96 1996 Carleton University Press 257 271
27. E. Sutinen, and J. Tarhio Filtration with q-samples in approximate string matching Proc. CPM'96 Lecture Notes in Comput. Sci. vol. 1075 1996 50 61
28. E. Ukkonen Approximate string matching over suffix trees Proc. CPM'93 1993 228 242
29. S. Wu, and U. Manber Fast text searching allowing errors Comm. ACM 35 10 1992 83 91