In this class, we explain the following relationship between approximate string matching and polynomial multiplication.
If you can multiply two polynomials of length N in time O(N log N). Then you can solve the problem of string matching problem in time O(n log m) where n is the length of the string and m is the length of the pattern.
No comments:
Post a Comment