Abstract
The main result of this paper is an algorithm for approximate matching of a regular expression of size m in a text of size n in time O( nm/log d+2 n), where d is the number of allowed errors. This algorithm is the first o( mn) algorithm for approximate matching to regular expressions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
