Download presentation
Presentation is loading. Please wait.
Published byMarja Kahma Modified over 6 years ago
1
In Pattern Matching Convolutions: O(n log m) using FFT b0 b1 b2
2
Problem: O(n log m) only in algebraically closed fields, e.g. C.
Solution: Reduce problem to (Boolean/integer/real) multiplication. S This reduction costs! Example: Hamming distance. A B A B C A B B B A Counting mismatches is equivalent to Counting matches
3
Example: Count all “hits” of 1 in pattern and 1 in text.
4
For Define: if a=b o/w Example:
5
For Do: + + Result: The number of times a in pattern matches a in text + the number of times b in pattern matches b in text + the number of times c in pattern matches c in text.
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.