Improved Bounds for Dictionary Look-up with One Error

Gerth Stølting Brodal, Srinivasan Venkatesh
1999 BRICS Report Series  
<p>Given a dictionary S of n binary strings each of length m,<br />we consider the problem of designing a data structure for S that<br />supports d-queries; given a binary query string q of length m, a<br />d-query reports if there exists a string in S within Hamming <br />distance d of q. We construct a data structure for the case d = 1, that<br />requires space O(n log m) and has query time O(1) in a cell probe<br />model with word size m. This generalizes and improves the <br />previous
more » ... s of Yao and Yao for the problem in the bit probe<br />model.</p><p>Keywords: Data Structures, Dictionaries, Hashing, Hamming Distance</p><p> </p>
doi:10.7146/brics.v6i50.20120 fatcat:rl24hpxmlnegxohyqqdxsjwzuq