Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given two strings, a pattern P of length m and a text T of length n over some alphabet @S,  consider the string matching problem under k mismatches. The ll-known Shift-Add algorithm [R.A. Baeza-Yates, G.H. Gonnet, A new approach to text searching, Comm. ACM 35 (10) (1992) 74-82] solves the problem in O(n@?mlog(k)/w@?) worst case time, where w is the number of bits in a computer word.  present two algorithms that improve this result to O(n@?mloglog(k)/w@?) and O(n@?m/w@?), respectively. The algorithms make use of nested varying length bit-strings, that represent the search state.  call these Matryoshka counters. The techniques  developed are of more general use for string matching problems.
['Szymon Grabowski', 'Kimmo Fredriksson']
I am writing a research paper on a idea Bit-parallel string matching under Hamming distance in O(n⌈m/w⌉) worst case time
[{"from": "human", "value": "I am writing a research paper on a idea Bit-parallel string matching under Hamming distance in O(n\u2308m/w\u2309) worst case time"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given two strings, a pattern P of length m and a text T of length n over some alphabet @S,  consider the string matching problem under k mismatches. The ll-known Shift-Add algorithm [R.A. Baeza-Yates, G.H. Gonnet, A new approach to text searching, Comm. ACM 35 (10) (1992) 74-82] solves the problem in O(n@?mlog(k)/w@?) worst case time, where w is the number of bits in a computer word.  present two algorithms that improve this result to O(n@?mloglog(k)/w@?) and O(n@?m/w@?), respectively. The algorithms make use of nested varying length bit-strings, that represent the search state.  call these Matryoshka counters. The techniques  developed are of more general use for string matching problems."}]