Indexing text with approximate q-grams

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

Volumn 1848, Issue , 2000, Pages 350-363

  Navarro, Gonzalo ^a   Sutinen, Erkki ^b   Tanninen, Jani ^b   Tarhio, Jorma ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATE STRING MATCHING; ERROR LEVELS; FIXED INTERVALS; Q-GRAMS; SEARCH TIME; SPACE REQUIREMENTS; SUB-STRINGS;

PATTERN MATCHING;

EID: 84937439801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_29     Document Type: Conference Paper

References (27)

1. A. Apostolico and Z. Galil. Combinatorial Algorithms on Words. Springer-Verlag, New York, 1985
2. M. Ara_ujo, G. Navarro, and N. Ziviani. Large text searching allowing errors. In Proc. WSP'97, pages 2-20. Carleton University Press, 1997
3. R. Baeza-Yates. Text retrieval: Theory and practice. In 12th IFIP World Computer Congress, volume I, pages 465-476. Elsevier Science, September 1992
4. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999
5. R. Baeza-Yates and G. Navarro. Block-addressing indices for approximate text retrieval. J. of the American Society for Information Science (JASIS), 51(1):69-82, January 2000
6. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, and J. Seiferas. The samllest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31-55, 1985
7. W. Chang and T. Marr. Approximate string matching and local similarity. In Proc. CPM'94, LNCS 807, pages 259-273, 1994
8. A. Cobbs. Fast approximate matching using suffx trees. In Proc. CPM'95, pages 41-54, 1995. LNCS 937
9. M. Crochemore. Transducers and repetitions. Theoretical Computer Science, 45:63-86, 1986
10. M. Farach, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottle-neck in su_x tree construction. In Proc. SODA'98, pages 174-183, 1998
11. R. Giegerich, S. Kurtz, and J. Stoye. E_cient implementation of lazy su_x trees. In Proc. WAE'99, LNCS 1668, pages 30-42, 1999
12. G. Gonnet. A tutorial introduction to Computational Biochemistry using Darwin. Technical report, Informatik E.T.H., Zuerich, Switzerland, 1992
13. G. Gonnet, R. Baeza-Yates, and T. Snider. Information Retrieval: Data Structures and Algorithms, chapter 3: New indices for text: Pat trees and Pat arrays, pages 66-82. Prentice-Hall, 1992
14. N. Holsti and E. Sutinen. Approximate string matching using q-gram places. In Proc. 7th Finnish Symposium on Computer Science, pages 23-32. University of Joensuu, 1994
15. P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In Proc. of MFCS'91, volume 16, pages 240-248, 1991
16. D. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973
17. U. Manber and E. Myers. Su_x arrays: a new method for on-line string searches. SIAM Journal on Computing, pages 935-948, 1993
18. U. Manber and S. Wu. glimpse: A tool to search through entire _le systems. In Proc. USENIX Technical Conference, pages 23-32, Winter 1994
19. E. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374, Oct/Nov 1994
20. G. Navarro. A guided tour to approximate string matching. Technical Report TR/DCC-99-5, Dept. of Computer Science, Univ. of Chile, 1999. To appear in ACM Computing Surveys. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/survasm.ps.gz
21. G. Navarro and R. Baeza-Yates. A practical q-gram index for text retrieval allowing errors. CLEI Electronic Journal, 1(2), 1998. http://www.clei.cl
22. G. Navarro and R. Baeza-Yates. A new indexing method for approximate string matching. In Proc. CPM'99, LNCS 1645, pages 163-186, 1999
23. P. Sellers. The theory and computation of evolutionary distances: pattern recog-nition. J. of Algorithms, 1:359-373, 1980
24. F. Shi. Fast approximate string matching with q-blocks sequences. In Proc. WSP'96, pages 257-271. Carleton University Press, 1996
25. E. Sutinen and J. Tarhio. Filtration with q-samples in approximate string match-ing. In Proc. CPM'96, LNCS 1075, pages 50-61, 1996
26. E. Ukkonen. Approximate string matching over su_x trees. In Proc. CPM'93, pages 228-242, 1993
27. S. Wu and U. Manber. Fast text searching allowing errors. Comm. of the ACM, 35(10):83-91, October 1992