Indexing structures for approximate string matching

Authors:
Alessandra Gabriele;Filippo Mignosi;Antonio Restivo;Marinella Sciortino
Affiliations:
Dipartimento di Matematica ed Applicazioni, Università degli Studi di Palermo, Palermo, Italy;Dipartimento di Matematica ed Applicazioni, Università degli Studi di Palermo, Palermo, Italy;Dipartimento di Matematica ed Applicazioni, Università degli Studi di Palermo, Palermo, Italy;Dipartimento di Matematica ed Applicazioni, Università degli Studi di Palermo, Palermo, Italy
Venue:
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Year:
2003

Citing 4
Cited 11

Data structures and algorithms for approximate string matching

Journal of Complexity
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Efficient algorithms for document retrieval problems

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Preface

Theoretical Computer Science - The art of theory
A new method for approximate indexing and dictionarylookup with one error

Information Processing Letters
Languages with mismatches

Theoretical Computer Science
Text indexing with errors

Journal of Discrete Algorithms
From Nerode's congruence to suffix automata with mismatches

Theoretical Computer Science
A new method for approximate indexing and dictionary lookup with one error

Information Processing Letters
On the suffix automaton with mismatches

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Fast index for approximate string matching

Journal of Discrete Algorithms
Languages with mismatches and an application to approximate indexing

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Text indexing with errors

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Dictionary-symbolwise flexible parsing

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.