Revisiting motif finding: do bi-objective metaheuristics surpass single-objective metaheuristics?
Our findings question the common belief that single-objective metaheuristics are better suited for combinatorial problems like motif finding. The bi-objective formulation helps maintain diversity and avoid premature convergence, even with partially correlated objectives, resulting in better solutions than those obtained through dedicated single-objective optimization. Simple, interpretable problem-specific adaptations can yield substantial performance gains over sophisticated alternatives. These results suggest that bi-objective approaches may provide more robust and computationally efficient solutions for DNA motif discovery, opening new research directions in bioinformatics.
Authors
- Muhammad Ali Nayeem (ORCID: https://orcid.org/0000-0003-4164-6492)
- M. Sohel Rahman (ORCID: https://orcid.org/0000-0001-9419-6478)
- Suliman Aladhadh (ORCID: https://orcid.org/0000-0003-4349-8710)
- Shehab Sarar Ahmed (ORCID: https://orcid.org/0000-0002-6063-2689)
Institutions
- Qassim University (SA)
- Bangladesh University of Engineering and Technology (BD)
- Buraydah Colleges (SA)
Publication Details
- Journal
- BMC Bioinformatics
- Published
- 2025-11-27
- DOI
- https://doi.org/10.1186/s12859-025-06327-6
- Primary Topic
- Genomics and Chromatin Dynamics
- Type
- article
- Field-Weighted Citation Impact
- 0.00