Indexing and Dictionary Matching with One Error
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Dictionary Look-Up within Small Edit Distance
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Closest Pair Problem under the Hamming Metric
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Memory capacities for synaptic and structural plasticity
Neural Computation
Neural associative memory for brain modeling and information retrieval
Information Processing Letters - Special issue on applications of spiking neural networks
Neural associative memory with optimal bayesian learning
Neural Computation
| Hi-index | 0.00 |
We describe a technique for building hash indices for a large dictionary of strings. This technique permits robust retrieval of strings from the dictionary even when the query pattern has a significant number of errors. This technique is closely related to the classical Turan problem for hypergraphs. We propose a general method of multi-index construction by generalizing certain Turan hypergraphs. We also develop an accompanying theory for analyzing such hashing schemes. The resulting algorithms have been implemented and can be applied to a wide variety of recognition and retrieval problems.