Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Approximate Regular Expression Matching

  • Gonzalo NavarroEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_22

Years and Authors of Summarized Original Work

  • 1995; Wu, Manber, Myers

Problem Definition

Given a text string T = t1t2… tn and a regular expression R of length m denoting language, \(\mathcal{L}(R)\)

Keywords

Regular expression matching allowing errors or differences 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Gusfield D (1997) Algorithms on strings, trees and sequences. Cambridge University Press, CambridgezbMATHCrossRefGoogle Scholar
  2. 2.
    Myers EW (1996) Approximate matching of network expressions with spacers. J Comput Biol 3(1):33–51CrossRefGoogle Scholar
  3. 3.
    Myers EW, Miller W (1989) Approximate matching of regular expressions. Bull Math Biol 51:7–37MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Navarro G (2001) Nr-grep: a fast and flexible pattern matching tool. Softw Pract Exp 31:1265–1312zbMATHCrossRefGoogle Scholar
  5. 5.
    Navarro G (2004) Approximate regular expression searching with arbitrary integer weights. Nord J Comput 11(4):356–373MathSciNetzbMATHGoogle Scholar
  6. 6.
    Navarro G, Raffinot M (2002) Flexible pattern matching in strings – practical on-line search algorithms for texts and biological sequences. Cambridge University Press, CambridgezbMATHCrossRefGoogle Scholar
  7. 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–923CrossRefGoogle Scholar
  8. 8.
    Thompson K (1968) Regular expression search algorithm. Commun ACM 11(6):419–422zbMATHCrossRefGoogle Scholar
  9. 9.
    Wu S, Manber U (1992) Fast text searching allowing errors. Commun ACM 35(10):83–91CrossRefGoogle Scholar
  10. 10.
    Wu S, Manber U, Myers EW (1995) A subquadratic algorithm for approximate regular expression matching. J Algorithms 19(3):346–360MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of ChileSantiagoChile