An Efficient Metaheuristic Approach for Finding Motifs from DNA Sequences

Finding patterns of the short sequences in DNA, RNA protein sequence has immense biological significance. The characterization and recognition of motifs is therefore an important method for a more in-depth understanding of genes or proteins in their structure, function and relations of evolution. This is one of the classical problems in the field of computational biology and which is an NP Hard problem. In this paper, we have proposed an evolutionary approach to get the motifs from DNA sequence by searching candidate motifs using heuristic way from the data. We have included various mutation techniques in an evolutionary approach and found an efficient way to calculate the fitness of our candidate motifs. We have evaluated the fitness of found motifs from our approach with benchmark data sets. Our method performs better results in terms of accuracy and specificity.