Given a pattern of length m and a text of length n, commonly m≪n, this paper presents a randomized parallel algorithm for pattern matching in O(n1/10) (=O(n1/10+(n−m)1/10)) time on a newly proposed n3/5×n2/5 modular meshconnected computers with multiple buses. Furthermore, the time bound of our parallel algorithm can be reduced to O(n1/11) if fewer processors are used.
Fast bitwise pattern-matching algorithm for DNA sequences on modern hardware