An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem-Reference-Cited by-同舟云学术

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

Published:2020-02 Issue: Volume:512 Page:880-908
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Ben Ali Abdelkamel^ORCID,Luque Gabriel,Alba Enrique

Funder

MINECO

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference50 articles.

1. A new local search algorithm for the DNA fragment assembly problem;Alba,2007

2. A hybrid genetic algorithm for the dna fragment assembly problem;Alba,2008

3. A hybrid crow search algorithm for solving the DNA fragment assembly problem;Allaoui;Expert Syst. Appl.,2018

4. Hybridizing β-hill climbing with wavelet transform for denoising ecg signals;Alyasseri;Inf. Sci.,2018

5. Algebraic particle swarm optimization for the permutations search space;Baioletti,2017

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multi-day tourism recommendations for urban tourists considering hotel selection: A heuristic optimization approach;Omega;2024-07

2. Comprehensive learning TLBO with recursive precedence-based solution construction and multilevel local search for the linear ordering problem;Expert Systems with Applications;2024-03

3. Ensemble strategy using particle swarm optimisation variant and enhanced local search capability;Swarm and Evolutionary Computation;2024-02

4. Genome sequence assembly using metaheuristics;Comprehensive Metaheuristics;2023

5. An Ant Colony Approach with Subjective-Objective Weight Optimization for Service Selection;2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous & Trusted Vehicles (SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta);2022-12