How to allow a certain maximum number (<=5) of mismatch in substring matching? Is there any way to modify KMP to do this? Here is a problem relating to this theory
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 162 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 154 |
8 | pajenegod | 147 |
9 | Um_nik | 145 |
9 | BledDest | 145 |
How to allow a certain maximum number (<=5) of mismatch in substring matching? Is there any way to modify KMP to do this? Here is a problem relating to this theory
Name |
---|
Please share the problem link if available.
Thanks for share of the problem, I have just solved it. Following is hint.
hash+binary search can do almost everything KMP can do, but it's more powerful.