A review of estimation of distribution algorithms in bioinformatics

  • Armañanzas R
  • Inza I
  • Santana R
  • et al.
N/ACitations
Citations of this article
134Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformatics problems. Genetic algorithms, the most well-known and representative evolutionary search technique, have been the subject of the major part of such applications. Estimation of distribution algorithms (EDAs) offer a novel evolutionary paradigm that constitutes a natural and attractive alternative to genetic algorithms. They make use of a probabilistic model, learnt from the promising solutions, to guide the search process. In this paper, we set out a basic taxonomy of EDA techniques, underlining the nature and complexity of the probabilistic model of each EDA variant. We review a set of innovative works that make use of EDA techniques to solve challenging bioinformatics problems, emphasizing the EDA paradigm's potential for further research in this domain.

Cite

CITATION STYLE

APA

Armañanzas, R., Inza, I., Santana, R., Saeys, Y., Flores, J. L., Lozano, J. A., … Larrañaga, P. (2008). A review of estimation of distribution algorithms in bioinformatics. BioData Mining, 1(1). https://doi.org/10.1186/1756-0381-1-6

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