Finding motifs in DNA sequences applying a Multiobjective Artificial Bee Colony (MOABC) algorithm

27Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

González-Álvarez, D. L., Vega-Rodríguez, M. A., Gómez-Pulido, J. A., & Sánchez-Pérez, J. M. (2011). Finding motifs in DNA sequences applying a Multiobjective Artificial Bee Colony (MOABC) algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6623 LNCS, pp. 89–100). https://doi.org/10.1007/978-3-642-20389-3_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free