MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Indexing Methods for Approximate String Matching (2000) [37 citations — 5 self]

by Gonzalo Navarro ,  Ricardo Baeza-yates ,  Erkki Sutinen ,  Jorma Tarhio
IEEE Data Engineering Bulletin
Add To MetaCart

Abstract:

Indexing for approximate text searching is a novel problem receiving much attention because of its applications in signal processing, computational biology and text retrieval, to name a few. We classify most indexing methods in a taxonomy that helps understand their essential features. We show that the existing methods, rather than completely different as they are regarded, form a range of solutions whose optimum is usually somewhere in between.

Citations

449 Suffix arrays: a new method for on-line string searches – Manber, Myers - 1993
429 A space-economical suffix tree construction algorithm – McCreight - 1976
381 Information Retrieval: Data Structures and Algorithms. Prentice-Hall, Chapter 3: New indices for text: Pat trees and Pat arrays – Gonnet, Baeza-Yates, et al. - 1992
214 A guided tour to approximate string matching – Navarro
126 Finding approximate patterns in strings – Ukkonen - 1985
89 A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345--374, Oct/Nov – Myers - 1994
63 Two algorithms for approximate string matching in static texts – Jokinen, Ukkonen - 1991
52 Approximate string matching over suffix trees – Ukkonen - 1993
43 R.: A hybrid indexing method for approximate string matching – Navarro, Baeza-Yates - 2000
43 Constructing suffix trees on-line in linear time – Ukkonen - 1995
42 Text retrieval: Theory and practice – Baeza-Yates - 1992
38 On using q-gram locations in approximate string matching – Sutinen, Tarhio - 1995
36 Fast approximate matching using suffix trees – Cobbs - 1995
34 Filtration with q-samples in approximate string matching – Sutinen, Tarhio - 1996
32 Indexing text with approximate q-grams – Navarro, Sutinen, et al. - 2000
29 Efficient implementation of lazy suffix trees – Giegerich, Kurtz, et al. - 2003
28 A practical q-gram index for text retrieval allowing errors – Baeza-Yates, Navarro - 1998
24 A tutorial introduction to computational biochemistry using darwin – Gonnet - 1992
21 Approximate pattern matching with samples – Takaoka - 1994
19 Fast approximate string matching with q-blocks sequences – Shi - 1996
18 Approximate string matching using q-gram places – Holsti, Sutinen - 1994
12 Combinatorial Algorithms on Words – Apostolico, Galil - 1985
7 A fast algorithm on average for all-against-all sequence matching – Baeza-Yates, Gonnet - 1999
4 Approximate multiple string matching using spatial indexes – Bugnion, Roos, et al. - 1993