Algorithm for DNA sequence assembly by quantum annealing

K Nałęcz-Charkiewicz, RM Nowak - BMC bioinformatics, 2022 - Springer
Background The assembly task is an indispensable step in sequencing genomes of new
organisms and studying structural genomic changes. In recent years, the dynamic …

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 …

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 …

Optimizing the DNA fragment assembly using metaheuristic-based overlap layout consensus approach

Z Halim - Applied Soft Computing, 2020 - Elsevier
Nucleotide sequencing finds the exact order of nucleotides present in a DNA molecule. The
correct DNA sequence is required to obtain the desired information about the complete …

A memetic particle swarm optimization algorithm for solving the DNA fragment assembly problem

KW Huang, JL Chen, CS Yang, CW Tsai - Neural Computing and …, 2015 - Springer
Determining the sequence of a long DNA chain first requires dividing it into subset
fragments. The DNA fragment assembly (DFA) approach is then used for reassembling the …

An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem

AB Ali, G Luque, E Alba - Information Sciences, 2020 - Elsevier
This paper focuses on Particle Swarm Optimization (PSO) applied to the DNA fragment
assembly problem. Existing PSO algorithms for this permutation-based combinatorial …

Benchmark datasets for the DNA fragment assembly problem

GM Mallén-Fullerton, JA Hughes… - … Journal of Bio …, 2013 - inderscienceonline.com
Many computational intelligence approaches have been used for the fragment assembly
problem. However, the comparison and analysis of these approaches is difficult due to the …

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 …

Adaptation of harmony search algorithm for DNA fragment assembly problem

ED Ülker - 2016 SAI Computing Conference (SAI), 2016 - ieeexplore.ieee.org
DNA Fragment Assembly Problem (FAP) is an attractive research topic in the field of
bioinformatics. The aim of DNA FAP is to generate DNA sequences as close to the original …

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 …