A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem

Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in any genomic project, since the resulting chains are the basis of all the work. Therefore, the quality of these chains is a prime importance to the correct development of the project. The methods typically applied to this problem usually encounter difficulties on large instances, so more efficient techniques are necessary. In this context, this work proposes a new method combining a general purpose metaheuristic (an advanced cellular genetic algorithm which automatically regulates the intensity of the search) with a local search method specifically designed for this problem (PALS). This local search method (recently published) finds very accurate solutions in very short times. As a result, our proposal is a very accurate and efficient hybrid technique clearly outperforming the other existing ones.

• Type: Conference
• Year: 2008
• Where: CEC
• Authors: Bernabé Dorronsoro, Enrique Alba, Gabriel Luque, Pascal Bouvry
• Keywords: Artificial Intelligence, CEC 2008, Cellular Genetic Algorithm, Fragment Assembly Problem, Local Search Method