A new method for approximate indexing and dictionarylookup with one error

Authors:
Moritz G. Maaß;Johannes Nowak
Affiliations:
Fakultät für Informatik, TU München, Boltzmannstr., Garching, Germany;Fakultät für Informatik, TU München, Boltzmannstr., Garching, Germany
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 3

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

Algorithms on strings, trees, and sequences: computer science and computational biology
Text indexing and dictionary matching with one error

Journal of Algorithms
Approximate String-Matching over Suffix Trees

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
A Metric Index for Approximate String Matching

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Dictionary matching and indexing with errors and don't cares

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Indexing structures for approximate string matching

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

A metric index for approximate string matching

Theoretical Computer Science
Text indexing with errors

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

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the problem of designing an efficient index for approximate pattern matching. Despite ongoing efforts, this topic is still a challenge in combinatorial pattern matching. We present a new data structure that allows to report all matches in worst-case time O(|Σ|m + occ), which is linear in the pattern length m and the number of occurrences occ for alphabets of constant size |Σ|. Our index uses O(n |Σ| log n) extra space on average and with high probability, where n is the length of the text (indexing) or the number of strings to index (dictionary lookup).