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

被引:12
|
作者
Minetti, Gabriela [1 ]
Leguizamon, Guillermo
Alba, Enrique [2 ,3 ]
机构
[1] Natl Univ La Pampa, Lab Invest Sistemas Inteligentes, Santa Rosa, Argentina
[2] Univ Malaga, Dept Lenguajes & Ciencias Computac, E-29071 Malaga, Spain
[3] Tech Univ Ostrava, Ostrava, Czech Republic
关键词
Metaheuristic; Simulated Annealing; Problem Aware Local Search; Parallelism; Noisy instance; DNA Fragment Assembly Problem; GENETIC ALGORITHM; OPTIMIZATION; SEQUENCE;
D O I
10.1016/j.ins.2014.02.020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The DNA Fragment Assembly Problem (FAP) is an NP-complete that consists in reconstructing a DNA sequence from a set of fragments taken at random. The FAP has been successfully and efficiently solved through metaheuristics. But these methods usually face difficulties to succeed when noise appears in the input data or during the search, specially in large instances. In this regard, the design of more efficient techniques are indeed necessary. One example of these techniques found in literature is the Problem Aware Local Search (PALS) which represents a state-of-the-art and robust assembler to solve noisy instances. Although PALS performs better than other metaheuristics, the quality of the achieved solutions by this method can still be improved. Towards this aim, this work proposes a new hybrid and effective method that combines a local search technique specially designed for this problem (PALS) with Simulated Annealing (SA), which is further distributed following an island model. Our proposed hybrid approach showed an improved performance on the largest non-noisy and noisy instances when compared separately with Simulated Annealing and PALS. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:273 / 283
页数:11
相关论文
共 50 条
  • [1] Visualization for Analyzing Trajectory-Based Metaheuristic Search Algorithms
    Halim, Steven
    Yap, Roland H. C.
    Lau, Hoong Chuin
    ECAI 2006, PROCEEDINGS, 2006, 141 : 703 - +
  • [2] A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem
    Alba, Enrique
    Luque, Gabriel
    RECENT ADVANCES IN EVOLUTIONARY COMPUTATION FOR COMBINATORIAL OPTIMIZATION, 2008, 153 : 101 - 112
  • [3] Bee Algorithms for Solving DNA Fragment Assembly Problem with Noisy and Noiseless data
    Firoz, Jesun Sahariar
    Rahman, M. Sohel
    Saha, Tanay Kumar
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 201 - 208
  • [4] An improved problem aware local search algorithm for the DNA fragment assembly problem
    Ben Ali, Abdelkamel
    Luque, Gabriel
    Alba, Enrique
    Melkemi, Kamal E.
    SOFT COMPUTING, 2017, 21 (07) : 1709 - 1720
  • [5] An improved problem aware local search algorithm for the DNA fragment assembly problem
    Abdelkamel Ben Ali
    Gabriel Luque
    Enrique Alba
    Kamal E. Melkemi
    Soft Computing, 2017, 21 : 1709 - 1720
  • [6] A hybrid crow search algorithm for solving the DNA fragment assembly problem
    Allaoui, Mohcin
    Ahiod, Belaid
    El Yafrani, Mohamed
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 102 : 44 - 56
  • [7] Hybrid Meta-heuristics for DNA Fragment Assembly problem for noiseless data
    Firoz, Jesun Sahariar
    Rahman, M. Sohel
    Saha, Tanay Kumar
    2012 INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION (ICIEV), 2012, : 652 - 656
  • [8] Trajectory-based Traveling Salesman Problem for Multirotor UAVs
    Meyer, Fabian
    Glock, Katharina
    17TH ANNUAL INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (DCOSS 2021), 2021, : 335 - 342
  • [9] Trajectory-Based Observer for Hybrid Automata Fault Diagnosis
    Deng, Yi
    D'Innocenzo, Alessandro
    Julius, A. Agung
    2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, : 942 - 947
  • [10] Optimizing the DNA fragment assembly using metaheuristic-based overlap layout consensus approach
    Uzma
    Halim, Zahid
    APPLIED SOFT COMPUTING, 2020, 92