Reference : Iterated Local Search for de Novo Genomic Sequencing
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
Iterated Local Search for de Novo Genomic Sequencing
Dorronsoro, Bernabé mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Bouvry, Pascal mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Alba, Enrique [University of Málaga, Spain]
Lecture Notes in Computer Science
International Conference on Artifical Intelligence and Soft Computing
from 13-06-2010 to 17-06-2010
[en] The sequencing process of a DNA chain for reading its components supposes a complex process, since only small DNA fragments can be read nowadays. Therefore, the use of optimization algorithms is required to rebuild a single chain from all the small pieces. We address here a simplified version of the problem, in which no errors in the sequencing process are allowed. The methods typically used in the literature for this problem are not satisfactory when solving realistic size instances, so there is a need for new more efficient and accurate methods. We propose a new iterated local search algorithm, highly competitive with the best algorithms in the literature, and considerably faster.
University of Luxembourg: High Performance Computing - ULHPC

File(s) associated to this reference

Fulltext file(s):

Limited access
dorronsoro10Iterated Local Search for de Novo Genomic Sequencing.pdfPublisher postprint209.46 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.