TY  - JOUR
T1  - Genetic Algorithm for Planted Motif Search (l, d) with Iteration on Average Value
AU - Mohanty, Satarupa AU - Chauhan, Rohan AU - Sahoo, Biswajit 
JO  - International Journal of Soft Computing
VL  - 13
IS  - 1
SP  - 18
EP  - 24
PY  - 2018
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2018.18.24
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2018.18.24
KW  - Planted motif search
KW  -Genetic algorithm
KW  -average value
KW  -convergence
KW  -consistency
KW  -population
AB  - Analysis of motif in DNA sequences are growing into a significant context in the domain of gene regulation and in the same way, identification of motif is a most crucial issue in the study of computational biology. This study addresses the issues of motif search in biological DNA sequences using an evolutionary approach. The experiment is conducted using the Genetic algorithm framework along with a novel approach of generation of a highly fit population of solutions and then converging to optimal motif using secondary fitness function. The proposed model calculate the average value of given sequences and then iterate to generate the optimum population as the strings those are closer to the average value in order to achieve a better rate of convergence to the optimum motif. The experimental study on simulated data using evolutionary approach is recorded and proofs its consistency.
ER  -