Skip to main content
SpringerLink
Log in

Approximate String Matching

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Amir A, Lewenstein M, Porat E (2004) Faster algorithms for string matching with k mismatches. J Algorithms 50(2):257–275

    Article  MathSciNet  MATH  Google Scholar 

  2. Baeza-Yates R, Navarro G (1999) Faster approximate string matching. Algorithmica 23(2):127–158

    Article  MathSciNet  MATH  Google Scholar 

  3. Chang W, Marr T (1994) Approximate string matching and local similarity. In: Proceedings of the 5th annual symposium on combinatorial pattern matching (CPM’94), Asilomar. LNCS, vol 807. Springer, Berlin, pp 259–273

    Google Scholar 

  4. Cole R, Hariharan R (2002) Approximate string matching: a simpler faster algorithm. SIAM J Comput 31(6):1761–1782

    Article  MathSciNet  MATH  Google Scholar 

  5. Crochemore M, Landau G, Ziv-Ukelson M (2003) A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM J Comput 32(6):1654–1673

    Article  MathSciNet  MATH  Google Scholar 

  6. Fredriksson K, Navarro G (2004) Average-optimal single and multiple approximate string matching. ACM J Exp Algorithms 9(1.4)

    Google Scholar 

  7. Gusfield D (1997) Algorithms on strings, trees and sequences. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  8. Landau G, Vishkin U (1989) Fast parallel and serial approximate string matching. J Algorithms 10:157–169

    Article  MathSciNet  MATH  Google Scholar 

  9. Masek W, Paterson M (1980) A faster algorithm for computing string edit distances. J Comput Syst Sci 20:18–31

    Article  MathSciNet  MATH  Google Scholar 

  10. Myers G (1999) A fast bit-vector algorithm for approximate string matching based on dynamic progamming. J ACM 46(3):395–415

    Article  MathSciNet  MATH  Google Scholar 

  11. Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31–88

    Article  Google Scholar 

  12. Navarro G, Baeza-Yates R (1999) Very fast and simple approximate string matching. Inf Proc Lett 72:65–70

    Article  MathSciNet  MATH  Google Scholar 

  13. Sellers P (1980) The theory and computation of evolutionary distances: pattern recognition. J Algorithms 1:359–373

    Article  MathSciNet  MATH  Google Scholar 

  14. Ukkonen E (1985) Finding approximate patterns in strings. J Algorithms 6:132–137

    Article  MathSciNet  MATH  Google Scholar 

  15. Yao A (1979) The complexity of pattern matching for a random string. SIAM J Comput 8:368–387

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Chile, Blanco Encalada 2120, Santiago, Chile

    Gonzalo Navarro

Authors
  1. Gonzalo Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gonzalo Navarro .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Navarro, G. (2016). Approximate String Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_363

Download citation

Publish with us

Policies and ethics

Search

Navigation