On the role of metaheuristic optimization in bioinformatics
Metaheuristic algorithms are employed to solve complex and large‐scale optimization
problems in many different fields, from transportation and smart cities to finance. This paper …
problems in many different fields, from transportation and smart cities to finance. This paper …
A hybrid crow search algorithm for solving the DNA fragment assembly problem
M Allaoui, B Ahiod, M El Yafrani - Expert Systems with Applications, 2018 - Elsevier
The sequencing of DNA goes through a step of fragment assembly, this step is known as
DNA fragment assembly problem (FAP). Fragment assembly is considered as an NP-hard …
DNA fragment assembly problem (FAP). Fragment assembly is considered as an NP-hard …
An efficient-assembler whale optimization algorithm for DNA fragment assembly problem: analysis and validations
M Abdel-Basset, R Mohamed, KM Sallam… - IEEE …, 2020 - ieeexplore.ieee.org
The study of deoxyribonucleic acid (DNA) is crucial in many fields, including medicine,
biology, zoology, agriculture, and forensics. Since reading a DNA sequence is onerous …
biology, zoology, agriculture, and forensics. Since reading a DNA sequence is onerous …
Application of an improved discrete crow search algorithm with local search and elitism on a humanitarian relief case
İM Eligüzel, E Özceylan - Artificial Intelligence Review, 2021 - Springer
This paper demonstrates an application of the improved crow search algorithm (I-CSA),
which is a modified version of the crow search algorithm (CSA). CSA is a recent, nature …
which is a modified version of the crow search algorithm (CSA). CSA is a recent, nature …
An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem
This paper focuses on Particle Swarm Optimization (PSO) applied to the DNA fragment
assembly problem. Existing PSO algorithms for this permutation-based combinatorial …
assembly problem. Existing PSO algorithms for this permutation-based combinatorial …
An improved problem aware local search algorithm for the DNA fragment assembly problem
DNA fragment assembly is a critical and essential early task in a genome project. This task
leads to an NP-hard combinatorial optimization problem, and thus, efficient approximate …
leads to an NP-hard combinatorial optimization problem, and thus, efficient approximate …
Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy approach
JA Hughes, S Houghten, D Ashlock - Biosystems, 2016 - Elsevier
DNA Fragment assembly–an NP-Hard problem–is one of the major steps in of DNA
sequencing. Multiple strategies have been used for this problem, including greedy graph …
sequencing. Multiple strategies have been used for this problem, including greedy graph …
Recentering and restarting genetic algorithm variations for DNA fragment assembly
J Hughes, S Houghten… - … IEEE Conference on …, 2014 - ieeexplore.ieee.org
The Fragment Assembly Problem is a major component of the DNA sequencing process that
is identified as being NP-Hard. A variety of approaches to this problem have been used …
is identified as being NP-Hard. A variety of approaches to this problem have been used …
A memetic gravitation search algorithm for solving DNA fragment assembly problems
The DNA fragment assembly (DFA) problem is among the most critical problems in
computational biology. Being NP-hard, it can be efficiently solved via meta-heuristic …
computational biology. Being NP-hard, it can be efficiently solved via meta-heuristic …
Solving the DNA fragment assembly problem with a parallel discrete firefly algorithm implemented on GPU
PJ Vidal, AC Olivera - Computer Science and Information Systems, 2018 - doiserbia.nb.rs
The Deoxyribonucleic Acid Fragment Assembly Problem (DNA-FAP) consists in
reconstructing a DNA chain from a set of fragments taken randomly. This problem represents …
reconstructing a DNA chain from a set of fragments taken randomly. This problem represents …