Finding motifs in DNA sequences applying a multiobjective artificial bee colony (MOABC) algorithm

  • Authors:
  • David L. González-Álvarez;Miguel A. Vega-Rodríguez;Juan A. Gómez-Pulido;Juan M. Sánchez-Pérez

  • Affiliations:
  • University of Extremadura, Department of Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain;University of Extremadura, Department of Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain;University of Extremadura, Department of Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain;University of Extremadura, Department of Technologies of Computers and Communications, Escuela Politécnica, Cáceres, Spain

  • Venue:
  • EvoBIO'11 Proceedings of the 9th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work we propose the application of a Swarm Intelligence (SI) algorithm to solve the Motif Discovery Problem (MDP), applied to the specific task of discovering novel Transcription Factor Binding Sites (TFBS) in DNA sequences. In the last years there have appeared many new evolutionary algorithms based on the collective intelligence. Finding TFBS is crucial for understanding the gene regulatory relationship but, motifs are weakly conserved, and motif discovery is an NP-hard problem. Therefore, the use of such algorithms can be a good way to obtain quality results. The chosen algorithm is the Artificial Bee Colony (ABC), it is an optimization algorithm based on the intelligent foraging behaviour of honey bee swarm. To solve the MDP we have applied multiobjective optimization and consequently, we have adapted the ABC to multiobjective problems, defining the Multiobjective Artificial Bee Colony (MOABC) algorithm. New results have been obtained, that significantly improve those published in previous researches.