Soft Computing

, Volume 21, Issue 7, pp 1709–1720

An improved problem aware local search algorithm for the DNA fragment assembly problem

  • Abdelkamel Ben Ali
  • Gabriel Luque
  • Enrique Alba
  • Kamal E. Melkemi
Methodologies and Application

DOI: 10.1007/s00500-015-1875-2

Cite this article as:
Ben Ali, A., Luque, G., Alba, E. et al. Soft Comput (2017) 21: 1709. doi:10.1007/s00500-015-1875-2

Abstract

DNA fragment assembly is a critical and essential early task in a genome project. This task leads to an NP-hard combinatorial optimization problem, and thus, efficient approximate algorithms are required to tackle large problem instances. The Problem Aware Local Search (PALS) is one of the most efficient heuristics for this problem in the literature. PALS gives fairly good solutions but the probability of premature convergence to local optima is significant. In this paper, we propose two modifications to the PALS heuristic in order to ameliorate its performance. The first modification enables the algorithm to improve the tentative solutions in a more appropriate and beneficial way. The second modification permits a significant reduction in the computational demands of the algorithm without significant accuracy loss. Computational experiments confirm that our proposals lead to a more efficient and robust assembler, improving both accuracy and efficiency.

Keywords

Combinatorial optimization  DNA fragment assembly Problem Aware Local Search 

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Abdelkamel Ben Ali
    • 1
    • 3
  • Gabriel Luque
    • 2
  • Enrique Alba
    • 2
  • Kamal E. Melkemi
    • 3
  1. 1.Department of Computer ScienceUniversity of El-OuedEl-OuedAlgeria
  2. 2.Universidad de Málaga, Andalucía Tech, Departamento de Lenguajes y Ciencias de ComunicaciónMalagaSpain
  3. 3.Department of Computer ScienceUniversity of BiskraBiskraAlgeria

Personalised recommendations