Finding DNA Motifs with Collective Parallel Artificial Bee Colony Algorithm

Metaheuristic techniques have been successfully used to produce feasible solutions within the acceptable execution times for complex numerical or combinatorial problems on behalf of classical optimization or search techniques in recent years. The successes of the existing metaheuristic techniques also lead to increase the number of applications focused on solving bioinformatics problems. In this study, a new parallel implementation of the Artificial Bee Colony (ABC) algorithm named cooperative parallel ABC algorithm was used for finding common nucleotide sequences or motifs within DNA strings. Experimental results obtained with the studies on extracting motifs from the DNA sequences of human showed that cooperative model based parallel ABC algorithm is capable of finding more qualified solutions compared to conventional serial and parallel model of the same algorithm.