@article {20343,
	title = {A Benali, G Luque, E Alba and Kamal E. Melkemi: An improved problem aware local search algorithm for the DNA fragment assembly problem},
	journal = {Soft Computing. , Springer},
	volume = {21},
	number = {7},
	year = {2017},
	pages = {1709-1720},
	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.},
	url = {https://www.springerprofessional.de/en/an-improved-problem-aware-local-search-algorithm-for-the-dna-fra/5276698}
}
