Analysing the scalability of multiobjective evolutionary algorithms when solving the motif discovery problem

DOI10.1007/S10898-013-0069-7zbMath1315.90044OpenAlexW2136127214MaRDI QIDQ377760

Miguel A. Vega-Rodríguez, David L. González-Álvarez

Publication date: 7 November 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0069-7

zbMATH Keywords

multiobjective programmingDNAevolutionary algorithmcomputer sciencescalability analysis

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Uses Software

• SPEA2
• ABC
• GSA

Cites Work

• Variable neighborhood search
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• GSA: A gravitational search algorithm
• Firefly Algorithms for Multimodal Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysing the scalability of multiobjective evolutionary algorithms when solving the motif discovery problem