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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
