A novel approach of finding planted motif in biological sequences

Motif finding is one of the most important and challenging tasks in computational biology. In this paper, a new algorithm for finding motif is presented. The strategy used in this paper speeds up the operations of finding the motif. Performance comparisons among the existing algorithms and proposed algorithm are also presented which shows that the proposed algorithm performs better in terms of accuracy and time complexity.