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

DOI10.3934/MBE.2019075MaRDI QIDQ2160676zbMATH OpenOpenAlexWikidataFDO

Authors Saeed Alirezanejad Gohardani, M. Bagherian, Hamidreza Vaziri

Publication date 3 August 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

DNA sequencesimperialist competitive algorithmmotif discoverymulti-objective optimizationtranscription factor binding site

Mathematics Subject Classification ID

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

Recommendations

• Improving a greedy DNA motif search using a multiple genomic self-adaptating genetic algo\-rithm
• Motif discovery using an immune genetic algorithm
• A Compact Mathematical Programming Formulation for DNA Motif Finding

Cites work

• Finding similar regions in many sequences
• Firefly Algorithms for Multimodal Optimization
• Handbook of metaheuristics
• RISOTTO: Fast Extraction of Motifs with Mismatches
• Toward optimal motif enumeration.

Cited in

(1)

• On the role of metaheuristic optimization in bioinformatics

Describes a project that uses

Uses Software

• SPEA2
• RISOTTO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160676)