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 …
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 …
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 …
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 …
This paper focuses on Particle Swarm Optimization (PSO) applied to the DNA fragment assembly problem. Existing PSO algorithms for this permutation-based combinatorial …
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 …
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 …
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 …
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 …