摘要：The purpose of this article is to realize an analysis for two methods that can be considered in order to create a parallel algorithm for pattern searching into a text. First, we are dealing with "Divide-and-Conquer" type approaches. Next, we are considering another type of approach, based on the decomposition of the initial problem into several simpler problems and with different initial data, but similar solutions. An algorithm for the later situation is sketched, in order to reveal some of the (possible) features of algorithms of this type
