In this study, a new genetic algorithm was developed to discover the best motifs in a set of DNA sequences. The main steps were: ¯nding the potential positions in each sequence by using few voters (1
5 sequences), constructing the chromosomes from the potential positions, evaluating the ¯tness for each gene (position) and for each chromosome, calculating the new random distribution, and using the new distribution to generate the next generation. To verify the e®ectiveness of the proposed algorit