Approximate Regular Expression Matching
Living reference work entry
First Online:
Received:
Accepted:
DOI: https://doi.org/10.1007/978-3-642-27848-8_22-2
Years and Authors of Summarized Original Work
1995; Wu, Manber, Myers
Problem Definition
Given a text stringT = \(t_{1}t_{2}\ldots t_{n}\)
Keywords
Regular expression matching allowing errors or differencesThis is a preview of subscription content, log in to check access.
References
- 1.Gusfield D (1997) Algorithms on strings, trees and sequences. Cambridge University Press, CambridgeCrossRefMATHGoogle Scholar
- 2.Myers EW (1996) Approximate matching of network expressions with spacers. J Comput Biol 3(1):33–51CrossRefGoogle Scholar
- 3.Myers EW, Miller W (1989) Approximate matching of regular expressions. Bull Math Biol 51:7–37CrossRefMathSciNetGoogle Scholar
- 4.Navarro G (2001) Nr-grep: a fast and flexible pattern matching tool. Softw Pract Exp 31:1265–1312CrossRefMATHGoogle Scholar
- 5.Navarro G (2004) Approximate regular expression searching with arbitrary integer weights. Nord J Comput 11(4):356–373MATHGoogle 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, CambridgeCrossRefMATHGoogle 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–923CrossRefGoogle Scholar
- 8.Thompson K (1968) Regular expression search algorithm. Commun ACM 11(6):419–422CrossRefMATHGoogle Scholar
- 9.Wu S, Manber U (1992) Fast text searching allowing errors. Commun ACM 35(10):83–91CrossRefGoogle Scholar
- 10.Wu S, Manber U, Myers EW (1995) A subquadratic algorithm for approximate regular expression matching. J Algorithms 19(3):346–360CrossRefMATHMathSciNetGoogle Scholar
Copyright information
© Springer Science+Business Media New York 2014