In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up to a certain distance, is proportional on average to |x| + |occ(x)|, under an additional but realistic hypothesis. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Gabriele, A., Mignosi, F., Restivo, A., & Sciortino, M. (2003). Indexing structures for approximate string matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2653, 140–151. https://doi.org/10.1007/3-540-44849-7_20
Mendeley helps you to discover research relevant for your work.