Skip to main content
SpringerLink
Log in

Approximate Regular Expression Matching

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 136 Accesses

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. Gusfield D (1997) Algorithms on strings, trees and sequences. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  2. Myers EW (1996) Approximate matching of network expressions with spacers. J Comput Biol 3(1):33–51

    Article  Google Scholar 

  3. Myers EW, Miller W (1989) Approximate matching of regular expressions. Bull Math Biol 51:7–37

    Article  MathSciNet  MATH  Google Scholar 

  4. Navarro G (2001) Nr-grep: a fast and flexible pattern matching tool. Softw Pract Exp 31:1265–1312

    Article  MATH  Google Scholar 

  5. Navarro G (2004) Approximate regular expression searching with arbitrary integer weights. Nord J Comput 11(4):356–373

    MathSciNet  MATH  Google Scholar 

  6. Navarro G, Raffinot M (2002) Flexible pattern matching in strings – practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  7. Navarro G, Raffinot M (2003) Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. J Comput Biol 10(6):903–923

    Article  Google Scholar 

  8. Thompson K (1968) Regular expression search algorithm. Commun ACM 11(6):419–422

    Article  MATH  Google Scholar 

  9. Wu S, Manber U (1992) Fast text searching allowing errors. Commun ACM 35(10):83–91

    Article  Google Scholar 

  10. Wu S, Manber U, Myers EW (1995) A subquadratic algorithm for approximate regular expression matching. J Algorithms 19(3):346–360

    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 Regular Expression Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_22

Download citation

Publish with us

Policies and ethics

Search

Navigation