Abstract
Let [Formula: see text] 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 [Formula: see text] within Hamming distance d of a given binary query string q. We present a simple algorithm to determine if there is a member in [Formula: see text] within edit distanced 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. We also generalize the results for the case of the problem over a larger alphabet.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
