Multiobjective optimization algorithms for motif discovery in DNA sequences

作者：Gonzalez Alvarez David L^*; Vega Rodriguez Miguel A; Rubio Largo Alvaro

来源：Genetic Programming and Evolvable Machines, 2015, 16(2): 167-209.

DOI：10.1007/s10710-014-9232-2

• Computer science
• Multiobjective optimization
• Metaheuristics
• Motif discovery
• Bioinformatics

Optimization techniques have become powerful tools for approaching multiple NP-hard optimization problems. In this kind of problem it is practically impossible to obtain optimal solutions, thus we must apply approximation strategies such as metaheuristics. In this paper, seven metaheuristics have been used to address an important biological problem known as the motif discovery problem. As it is defined as a multiobjective optimization problem, we have adapted the proposed algorithms to this optimization context. We evaluate the proposed metaheuristics on 54 sequence datasets that belong to four organisms with different numbers of sequences and sizes. The results have been analysed in order to discover which algorithm performs best in each case. The algorithms implemented and the results achieved can assist biological researchers in the complicated task of finding DNA patterns with an important biological relevance.

• 出版日期2015-6