Abstract
In this paper we propose and study the behavior of a new heuristic algorithm for the DNA fragment assembly problem: PALS. The DNA fragment assembly is a problem to be solved in the early phases of the genome project and thus is very important since the other steps depend on its accuracy. This is an NP-hard combinatorial optimization problem which is growing in importance and complexity as more research centers become involved on sequencing new genomes. Various heuristics, including genetic algorithms, have been designed for solving the fragment assembly problem, but since this problem is a crucial part of any sequencing project, better assemblers are needed. Our proposal is a very efficient assembler that allows to find optimal solutions for large instances of this problem, considerably faster than its competitors and with high accuracy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
