Name
Title | ||
|---|---|---|
An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem |
Abstract | ||
|---|---|---|
•Our new PSO exploits the structure of the DNA fragment assembly task and works directly in the combinatorial search space.•It ensures uniform convergence and an appropriate balance between intensification and diversification.•It performs much better than PSO variants with space transformation techniques.•Furthermore, a new fast variant of the best state-of-the-art local search is designed.•Memetic algorithms taking advantage of the strengths of the proposed algorithms perform better than the best existing techniques. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ins.2019.10.026 | Information Sciences |
Keywords | Field | DocType |
DNA fragment assembly,Permutation problem,Edge recombination,Particle swarm optimization,Problem aware local search,Memetic metaheuristic | Integer,Particle swarm optimization,Adjacency list,Heuristic,Permutation,Algorithm,Artificial intelligence,Operator (computer programming),Probabilistic logic,Local search (optimization),Machine learning,Mathematics | Journal |
Volume | ISSN | Citations |
512 | 0020-0255 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abdelkamel Ben Ali | 1 | 0 | 0.34 |
| gabriel luque | 2 | 72 | 7.91 |
| Alba Enrique | 3 | 143 | 8.74 |