An Approach For Recognition Of Transcription Factor Binding Sites Based On Genetic Algorithm

Identification of transcription factor binding sites is an important step towards the understanding of the transcription regulation. Reliable prediction of transcription factor binding sites can be used to identify the target genes of transcription factors and infer the relationship between the positions of the binding sites and regulation activity of transcription factors. The binding site of transcription factor is not unique, so we build a model for all the binding sites of one transcription factor and call it motif. Most of method to identification of transcription factor binding sites is base on it at present.This paper proposes a new transcription factor binding sites finding method based on genetic algorithm. Genetic algorithm is a computation model that simulating bio-evolution in nature, a artificial intelligence technology that adaptive and self-organizing. As a global optimization search method, genetic algorithm has been more and more popular because of its simpleness, currency, strong robustness, and so on. By the way of using consensus model as the descriptive model of motif and encoding, the new approach in this paper converts this assignment to an optimization problem in a search space, searches the optimum solution by genetic algorithm.The algorithm in this paper implemented by C++ is applied to motif and pending sequence alignment in the experiment. It can prevent the premature convergence and other problems by adjusting the controls parameter in the process of search. The results demonstrate that the new approach is reasonable and efficient.