Dictionary Look-Up with One Error
- 1 October 1997
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 25 (1), 194-202
- https://doi.org/10.1006/jagm.1997.0875
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Finding the neighborhood of a query in a dictionaryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multi-index hashing for information retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An algorithm for approximate membership checking with application to password securityInformation Processing Letters, 1994
- Approximate string matching with suffix automataAlgorithmica, 1993
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Fast string matching with k differencesJournal of Computer and System Sciences, 1988
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Should Tables Be Sorted?Journal of the ACM, 1981
- Efficient Storage and Retrieval by Content and Address of Static FilesJournal of the ACM, 1974