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

DOI10.3934/mbe.2019075zbMath1497.92184OpenAlexW2916339070WikidataQ92853351 ScholiaQ92853351MaRDI QIDQ2160676

Hamidreza Vaziri, Saeed Alirezanejad Gohardani, Mehri Bagherian

Publication date: 3 August 2022

Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mbe.2019075

zbMATH Keywords

multi-objective optimizationDNA sequencesimperialist competitive algorithmmotif discoverytranscription factor binding site

Mathematics Subject Classification ID

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

Related Items (1)

On the role of metaheuristic optimization in bioinformatics

Uses Software

• SPEA2
• RISOTTO

Cites Work

• Finding similar regions in many sequences
• RISOTTO: Fast Extraction of Motifs with Mismatches
• Firefly Algorithms for Multimodal Optimization
• Algorithms and Data Structures
• Handbook of metaheuristics

This page was built for publication: A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences