Solving Planted-Motif Problem A New Approach

This paper presents a new method for solving planted-motif problem, which is a well-known motif-finding problem in the field of computational molecular biology. Motif-finding problem is considered to be a NP-complete problem and constant research is being carried out to solve the stated problem using some deterministic algorithm in polynomial time. This paper is an attempt to solve the plated-motif problem using a deterministic method in polynomial time. The method presented is not an exact algorithm but the probability of success is quite high. Significance of the technique is its simplicity and time efficiency. The presented technique is implemented as one of the modules in our general-purpose tool by the name "Sequence Comparison and Analysis Tool" for solving a number of sequence comparison problems encountered in the field of bioinformatics.