Skip to main content
Springer Nature Link
Log in

Dictionary Look-Up within Small Edit Distance

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2387))

Included in the following conference series:

  • 601 Accesses

Abstract

Let \( \mathcal{W} \) 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 \( \mathcal{W} \) within Hamming distance d of a given binary query string q. We present an algorithm to determine if there is a member in \( \mathcal{W} \) within edit distance d of a given query string q of length m. The method takes time O(dm d+1) in the RAM model, independent of n, and requires O(dm) additional space.

Supported in part by NSF Grant No. EIA-9818320.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. P. Bieganski. Genetic Sequence Data Retrieval and Manipulation based on Generalized Suffix Trees. PhD thesis, University of Minnesota, 1995.

    Google Scholar 

  2. G. S. Brodal and L. Gçsieniec. Approximate dictionary queries, in: Poc. 7th Combinatorial Pattern Matching, LNCS, Vol. 1075, Springer, Berlin, 65–74, 1996.

    Google Scholar 

  3. G. S. Brodal and S. Velkatesh. Improved bounds for dictionary look-up with one error. IPL, 75, 57–59, 2000.

    Article  Google Scholar 

  4. D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, 1997.

    Google Scholar 

  5. D. Dolev, Y. Harari, N. Linial, N. Nisan and M. Parnas. Neighborhood preserving hashing and approximate queries. Proceedings of the Fifth ACM SODA, 1994.

    Google Scholar 

  6. D. Dolev, Y. Harari and M. Parnas. Finding the neighborhood of a query in a dictionary. Proceedings of the Second Israel Symposium on Theory of Computing and Systems, 1993.

    Google Scholar 

  7. D. Greene, M. Parnas and F. Yao. Multi-index hashing for information retrieval. Proceedings of 1994 IEEE FOCS, pp. 722–731, November 1994.

    Google Scholar 

  8. D. K. Kim, J. S. Lee, K. Park and Y. Cho. Algorithms for approximate string matching with swaps. J. of Complexity, 15, 128–147, 1997.

    Article  MathSciNet  Google Scholar 

  9. U. Manber and S. Wu. An algorithm for approximate membership checking with applications to password security. IPL, 50, 191–197, 1994.

    Article  MATH  Google Scholar 

  10. M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge, MA, 1969.

    MATH  Google Scholar 

  11. E. W. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1(2):251–266, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  12. E. Ukkonen. Algorithms for Approximate String Matching. Information and Control, 64, 100–118, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  13. R. A. Wagner and M. J. Fisher. The string-to-string correction problem. JACM, 21(1):168–173, January 1974.

    Google Scholar 

  14. A. C. Yao and F. F. Yao. Dictionary look-up with one error. J. of Algorithms, 25(1), 194–202, 1997.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Abdullah N. Arslan & Ömer Eğecioğlu

Authors
  1. Abdullah N. Arslan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ömer Eğecioğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arslan, A.N., Eğecioğlu, Ö. (2002). Dictionary Look-Up within Small Edit Distance. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics