DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE-Reference-Cited by-同舟云学术

DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE

Published:2004-02 Issue:01 Volume:15 Page:57-71
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

ARSLAN ABDULLAH N.¹,EĞECIOĞLU ÖMER²

Affiliation:

1. Department of Computer Science, University of Vermont, Burlington, VT 05405, USA

2. Department of Computer Science, University of California, Santa Barbara, Santa Barbara, CA 93106, USA

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054104002303

Reference11 articles.

1. Approximate dictionary queries

2. Improved bounds for dictionary look-up with one error

3. Algorithms on Strings, Trees and Sequences

4. Efficient Algorithms for Approximate String Matching with Swaps

5. An algorithm for approximate membership checking with application to password security

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Partial 3D object retrieval using local binary QUICCI descriptors and dissimilarity tree indexing;Computers & Graphics;2021-11

2. An indexing scheme and descriptor for 3D object retrieval based on local shape querying;Computers & Graphics;2020-11

3. Variants of constrained longest common subsequence;Information Processing Letters;2010-09

4. Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets;LATIN 2006: Theoretical Informatics;2006