An Efficient Ant Colony Algorithm for DNA Motif Finding

摘要

Finding motifs in gene sequences is one of the most important problems of bioinformatics and belongs to NP-hard type. This paper proposes a new ant colony optimization algorithm based on consensus approach, in which a relax technique is applied to find the location of the motif. The efficiency of the algorithm is evaluated by comparing it with the state-of-the-art algorithms.