A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences

Abstract

<abstract> <p>Motif discovery problem (MDP) is one of the well-known problems in biology which tries to find the transcription factor binding site (TFBS) in DNA sequences. In one aspect, there is not enough biological knowledge on motif sites and on the other side, the problem is NP-hard. Thus, there is not an efficient procedure capable of finding motifs in every dataset. Some algorithms use exhaustive search, which is very time-consuming for large-scale datasets. On the other side, metaheuristic procedures seem to be a good selection for finding a motif quickly that at least has some acceptable biological properties. Most of the previous methods model the problem as a single objective optimization problem; however, considering multi-objectives for modeling the problem leads to improvements in the quality of obtained motifs. Some multi-objective optimization models for MDP have tried to maximize three objectives simultaneously: Motif length, support, and similarity. In this study, the multi-objective Imperialist Competition Algorithm (ICA) is adopted for this problem as an approximation algorithm. ICA is able to simulate more exploration along the solution space, so avoids trapping into local optima. So, it promises to obtain good solutions in a reasonable time. Experimental results show that our method produces good solutions compared to well-known algorithms in the literature, according to computational and biological indicators.</p> </abstract>

On the role of metaheuristic optimization in bioinformatics

“…Gohardani et al. (2019) propose a multiobjective imperialist competition algorithm (ICA). The performance of the metaheuristics is assessed by many metrics, such as hypervolume and coverage relation.…”

“…González-Álvarez et al ( 2015) compare the performance of seven multiobjective metaheuristics for finding motifs. Gohardani et al (2019) propose a multiobjective imperialist competition algorithm (ICA). The performance of the metaheuristics is assessed by many metrics, such as hypervolume and coverage relation.…”

“…According to Glover and Kochenberger (2006), metaheuristics are iterative processes that guide a set of subordinate heuristics in order to generate high-quality solutions for an optimization problem. When the optimization problem is NP-hard, metaheuristics are required to solve large-scale instances in reasonable computing times.…”

Optimal operation of water resources systems using MOICA algorithm with reservoir hedging approach in low‐water regions*

“…Because of the appropriate design of this model and picking better solutions at each iteration of equations based on the evaluation of both conflict objective functions, this calculation has a preferred presentation over the normal ICA model (Enayatifar et al, 2013). According to the difficulties mentioned about the common ICA algorithm and due to the capability of the MOICA algorithm to solve different complex problems based on expected purposes (Gohardani, Bagherian, & Vaziri, 2019; Bayesteh & Azari, 2021), the MOICA algorithm is employed in this paper.…”