An improved trajectory-based hybrid metaheuristic applied to the noisy DNA Fragment Assembly Problem-Reference-Cited by-同舟云学术

An improved trajectory-based hybrid metaheuristic applied to the noisy DNA Fragment Assembly Problem

Published:2014-09 Issue: Volume:277 Page:273-283
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Minetti Gabriela,Leguizamón Guillermo,Alba Enrique

Publisher

Elsevier BV

Subject

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

Reference31 articles.

1. Parallel evolutionary algorithms can achieve super-linear performance;Alba;Inf. Process. Lett.,2002

2. Parallel Metaheuristics: A New Class of Algorithms, WILEY Series on Parallel and Distributed Computing;Alba,2005

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

4. A hybrid genetic algorithm for the DNA fragment assembly problem;Alba,2008

5. E. Alba, G. Luque, G. Minetti, Variable neighborhood search for solving the DNA fragment assembly problem, in: Proceedings of XIII Congreso Argentino de Ciencias de la Computación (CACIC 2007), Corrientes, Argentina, pp. 1359–1370.

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

1. Challenges, opportunities, and future prospects;Metaheuristics Algorithms for Medical Applications;2024

2. An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem;Information Sciences;2020-02

3. Maximum Exact Matches for High Throughput Genome Subsequence Assembly;IETE Journal of Research;2019-04-15

4. Specific Parameter-Free Global Optimization to Speed Up Setting and Avoid Factors Interactions;Computing and Informatics;2019

5. A stochastic de novo assembly algorithm for viral-sized genomes obtains correct genomes and builds consensus;Information Sciences;2017-12