Improved Bounds for Dictionary Look-up with One Error
DOI:
https://doi.org/10.7146/brics.v6i50.20120Resumé
Given a dictionary S of n binary strings each of length m,
we consider the problem of designing a data structure for S that
supports d-queries; given a binary query string q of length m, a
d-query reports if there exists a string in S within Hamming
distance d of q. We construct a data structure for the case d = 1, that
requires space O(n log m) and has query time O(1) in a cell probe
model with word size m. This generalizes and improves the
previous bounds of Yao and Yao for the problem in the bit probe
model.
Keywords: Data Structures, Dictionaries, Hashing, Hamming Distance
Downloads
Publiceret
1999-12-20
Citation/Eksport
Brodal, G. S., & Venkatesh, S. (1999). Improved Bounds for Dictionary Look-up with One Error. BRICS Report Series, 6(50). https://doi.org/10.7146/brics.v6i50.20120
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
