MDGA: motif discovery using a genetic algorithm

Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive research for a decade. To predict the binding site locations efficiently, many algorithms that incorporate either approximate or heuristic techniques have been developed. However, the prediction accuracy is not satisfactory and binding site prediction thus remains a challenging problem. In this paper, we develop an approach that can be used to predict binding site motifs using a genetic algorithm. Based on the generic framework of a genetic algorithm, the approach explores the search space of all possible starting locations of the binding site motifs in different target sequences with a population that undergoes evolution. Individuals in the population compete to participate in the crossovers and mutations occur with a certain probability. Initial experiments demonstrated that our approach could achieve high predi...

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Dongsheng Che, Yinglei Song, Khaled Rasheed
• Keywords: Binding Site, Binding Site Motifs, GECCO 2005, Genetic Algorithms