Abstract. The Deoxyribonucleic Acid Fragment Assembly Problem (DNA-FAP) consists in reconstructing a DNA chain from a set of fragments taken randomly. This.
This work develops a discrete firefly algorithm (FA) on a graphics processing unit (GPU) architecture aiming to speed up the search process for solving the FAP.
The Deoxyribonucleic Acid Fragment Assembly Problem (DNA-FAP) consists in reconstructing a DNA chain from a set of fragments taken randomly.
Therefore, the use of GPU-based parallel computing it is possible as a complementary tool to speed-up the search. In this work we design and implement a ...
Two well-known permutation optimization problems (Travelling Salesman Problem and DNA Fragment Assembling Problem) were employed in order to test GPU-DFA.
This problem consists in reconstructing a DNA chain as close to the original sequence from a set of DNA fragments taken randomly. Several authors have proposed ...
2014. Solving the DNA fragment assembly problem with a parallel discrete firefly algorithm implemented on GPU. PJ Vidal, AC Olivera. Computer Science and ...
People also ask
What is the firefly algorithm used for?
What is the DNA fragment assembly problem?
The article describes the design and implementation of the Discrete Firefly Algorithm (DFA) which solves this problem using a parallel GPU architecture. Osama A ...
A Parallel Discrete Firefly Algorithm on GPU for Permutation Combinatorial Optimization Problems. https://doi.org/10.1007/978-3-662-45483-1_14.
This paper proposes a new approach for parallel implementation of genetic algorithm on graphics processing units (GPUs) using CUDA programming model that ...