Algorithms for approximate string matching
Information and Control
An algorithm for approximate membership checking with application to password security
Information Processing Letters
Genetic sequence data retrieval and manipulation based on generalized suffix trees
Genetic sequence data retrieval and manipulation based on generalized suffix trees
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Dictionary look-up with one error
Journal of Algorithms
Efficient algorithms for approximate string matching with swaps
Journal of Complexity
Neighborhood preserving hashing and approximate queries
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The String-to-String Correction Problem
Journal of the ACM (JACM)
Improved bounds for dictionary look-up with one error
Information Processing Letters
Approximate Dictionary Queries
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Multi-index hashing for information retrieval
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Detecting near-duplicates for web crawling
Proceedings of the 16th international conference on World Wide Web
Foundations and Trends in Databases
| Hi-index | 0.00 |
Let W be a dictionary consisting of n binary strings of length m each, represented as a trie. The usual d-query asks if there exists a string in W within Hamming distance d of a given binary query string q. We present an algorithm to determine if there is a member in W within edit distance d of a given query string q of length m. The method takes time O(dmd+1) in the RAM model, independent of n, and requires O(dm) additional space.